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 listApr 20, 2026 23:46Taylor DettlingTaylor DettlingError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 23:460524,687,838500,824,0001,999,0002,310,144expected "1020811 ", got "1033383 "
2Apr 20, 2026 23:460527,641,528500,829,0001,999,0002,310,144expected "1019015 ", got "1026952 "
3Apr 20, 2026 23:460525,458,333500,640,000999,0002,310,144expected "1020190 ", got "1010953 "