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 listMay 22, 2026 20:06M-RochatM-RochatScore: 18,738Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 20:0718,387616,858,213601,658,0005,129,0002,125,824
2May 22, 2026 20:0718,452620,869,131602,768,0006,154,0002,125,824
3May 22, 2026 20:0718,683629,407,742610,360,0006,195,0002,125,824
4May 22, 2026 20:0718,690628,656,062610,595,0006,176,0002,125,824
5May 22, 2026 20:0718,738630,326,477612,196,0006,183,0002,125,824
6May 22, 2026 20:0720,033671,222,350654,947,0006,143,0002,125,824
7May 22, 2026 20:0720,060672,102,347655,832,0006,157,0002,125,824
8May 22, 2026 20:0720,085673,415,812656,664,0006,145,0002,125,824
9May 22, 2026 20:0720,141676,361,579658,545,0006,128,0002,125,824