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 listJan 8, 2026 03:44Josu San MartinJosu San MartinScore: 47,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 03:4447,8891,612,449,6701,501,424,00078,917,0002,371,584
2Jan 8, 2026 03:4447,9061,613,651,1761,507,946,00072,949,0002,269,184
3Jan 8, 2026 03:4447,9611,608,658,8231,521,761,00060,950,0002,420,736