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 00:12M-RochatM-RochatScore: 19,753Success
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 00:1319,500655,343,076639,464,0004,037,0002,113,536
2May 17, 2026 00:1319,644659,993,063643,972,0004,293,0002,113,536
3May 17, 2026 00:1319,727660,775,483646,971,0004,038,0002,113,536
4May 17, 2026 00:1319,732662,036,091647,141,0004,044,0002,113,536
5May 17, 2026 00:1319,753663,797,097647,834,0004,043,0002,113,536
6May 17, 2026 00:1319,797663,121,815649,228,0004,076,0002,113,536
7May 17, 2026 00:1319,800665,566,331649,285,0004,120,0002,113,536
8May 17, 2026 00:1319,864664,532,573651,406,0004,119,0002,113,536
9May 17, 2026 00:1320,250677,142,110664,042,0004,218,0002,113,536