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 21, 2026 18:03M-RochatM-RochatScore: 18,661Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 18:0418,381616,175,147602,555,0004,032,0002,113,536
2May 21, 2026 18:0418,439618,127,042604,494,0004,018,0002,113,536
3May 21, 2026 18:0418,530624,143,020607,494,0004,007,0002,113,536
4May 21, 2026 18:0418,604624,361,744609,903,0004,060,0002,113,536
5May 21, 2026 18:0418,661627,543,241611,815,0004,019,0002,113,536
6May 21, 2026 18:0418,941634,736,938620,998,0004,056,0002,113,536
7May 21, 2026 18:0419,795664,214,434649,213,0004,032,0002,113,536
8May 21, 2026 18:0419,970669,783,902654,996,0004,028,0002,113,536
9May 21, 2026 18:0420,443684,160,198670,508,0004,115,0002,113,536