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 listJul 23, 2026 17:37boop34boop34Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 17:370401,307,249383,034,0008,529,0002,113,536expected "1023099 ", got "1022952 "
2Jul 23, 2026 17:370405,853,095387,261,0008,889,0002,113,536expected "1026420 ", got "1026297 "
3Jul 23, 2026 17:370404,835,492385,764,0009,205,0002,113,536expected "1026292 ", got "1026173 "