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 18, 2026 22:31e1011e1011Score: 33,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2026 22:3233,5651,118,593,8801,094,309,00013,349,0002,113,536
2Oct 18, 2026 22:3233,6271,120,452,3831,096,393,00013,317,0002,113,536
3Oct 18, 2026 22:3233,6361,121,231,7041,096,693,00013,317,0002,113,536
4Oct 18, 2026 22:3233,6961,122,815,6271,098,557,00013,439,0002,113,536
5Oct 18, 2026 22:3233,9741,131,957,5471,107,336,00013,815,0002,113,536
6Oct 18, 2026 22:3234,0451,134,302,6231,110,323,00013,164,0002,113,536
7Oct 18, 2026 22:3234,0501,134,856,7001,110,089,00013,589,0002,113,536
8Oct 18, 2026 22:3234,0751,135,413,4111,110,748,00013,750,0002,113,536
9Oct 18, 2026 22:3234,1401,137,446,5661,113,052,00013,591,0002,113,536