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 23:57M-RochatM-RochatScore: 27,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 00:0227,312911,496,717894,977,0006,351,0002,113,536
2May 18, 2026 00:0227,363915,586,717896,690,0006,295,0002,113,536
3May 18, 2026 00:0227,535918,677,896902,488,0006,194,0002,113,536
4May 18, 2026 00:0227,551919,691,067902,964,0006,246,0002,113,536
5May 18, 2026 00:0227,573919,307,704903,649,0006,261,0002,113,536
6May 18, 2026 00:0227,900930,405,806914,439,0006,265,0002,113,536
7May 18, 2026 00:0227,963933,411,646916,586,0006,207,0002,113,536
8May 18, 2026 00:0229,537986,777,036968,307,0006,435,0002,113,536
9May 18, 2026 00:0229,645988,695,202971,294,0007,014,0002,113,536