Unique strings Sergey Svistunov

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listAug 13, 2026 19:06Tomislav TunkovicTomislav TunkovicScore: 8,413Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 19:078,394285,437,548272,777,0004,246,0002,121,728stderr
2Aug 13, 2026 19:078,395285,353,742272,749,0004,287,0002,121,728stderr
3Aug 13, 2026 19:078,402285,796,115273,055,0004,215,0002,121,728stderr
4Aug 13, 2026 19:078,409285,955,508273,304,0004,197,0002,121,728stderr
5Aug 13, 2026 19:078,413285,971,901273,445,0004,214,0002,121,728stderr
6Aug 13, 2026 19:078,416286,255,035273,528,0004,205,0002,121,728stderr
7Aug 13, 2026 19:078,418286,062,080273,296,0004,503,0002,121,728stderr
8Aug 13, 2026 19:078,419285,971,006273,641,0004,197,0002,121,728stderr
9Aug 13, 2026 19:078,462287,653,571275,016,0004,241,0002,121,728stderr