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 listOct 17, 2026 04:21e1011e1011Error
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 04:2204,623,297,3994,611,392,0001,000,0002,113,536expected "1021871 ", got "781036 "
2Oct 17, 2026 04:2204,624,070,5284,612,145,0001,006,0002,113,536expected "1021533 ", got "780708 "
3Oct 17, 2026 04:2204,638,914,2114,627,028,0001,001,0002,113,536expected "1020737 ", got "780483 "