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 01:31e1011e1011Score: 322,609Success
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 01:32321,33410,615,250,99810,576,308,00027,722,0002,113,536
2Oct 17, 2026 01:32322,60910,657,227,43710,615,508,00030,599,0002,113,536
3Oct 17, 2026 01:32324,43310,717,251,00010,677,989,00028,308,0002,113,536