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 17, 2026 02:06M-RochatM-RochatScore: 22,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:1022,520753,892,139737,676,0005,507,0002,113,536
2May 17, 2026 02:1022,565754,912,863739,161,0005,487,0002,113,536
3May 17, 2026 02:1022,590754,673,662740,083,0005,396,0002,113,536
4May 17, 2026 02:1022,595757,911,886740,235,0005,419,0002,113,536
5May 17, 2026 02:1022,624757,890,743741,043,0005,566,0002,113,536
6May 17, 2026 02:1022,726760,719,914744,441,0005,522,0002,113,536
7May 17, 2026 02:1022,946767,013,003751,801,0005,446,0002,113,536
8May 17, 2026 02:1023,151774,332,239758,221,0005,789,0002,113,536
9May 17, 2026 02:1024,672824,642,388808,099,0006,101,0002,113,536