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 19:58M-RochatM-RochatScore: 19,869Success
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 19:5919,451653,069,574637,860,0004,053,0002,113,536
2May 22, 2026 19:5919,456653,784,790637,938,0004,124,0002,113,536
3May 22, 2026 19:5919,714662,922,307646,441,0004,130,0002,113,536
4May 22, 2026 19:5919,820666,557,787649,973,0004,112,0002,113,536
5May 22, 2026 19:5919,869665,126,329651,615,0004,063,0002,113,536
6May 22, 2026 19:5919,952670,743,590654,319,0004,122,0002,113,536
7May 22, 2026 19:5920,233677,583,145663,558,0004,156,0002,113,536
8May 22, 2026 19:5920,280680,726,780665,028,0004,232,0002,113,536
9May 22, 2026 19:5921,198710,249,507695,429,0004,117,0002,113,536