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 18, 2026 17:12M-RochatM-RochatScore: 21,943Success
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 17:1320,895699,842,826686,425,0003,111,0002,113,536
2May 18, 2026 17:1321,004703,142,508689,978,0003,171,0002,113,536
3May 18, 2026 17:1321,118708,448,400693,900,0003,005,0002,113,536
4May 18, 2026 17:1321,182710,514,241695,949,0003,061,0002,113,536
5May 18, 2026 17:1321,943735,822,191721,132,0003,008,0002,113,536
6May 18, 2026 17:1322,100740,591,745725,269,0004,037,0002,113,536
7May 18, 2026 17:1322,106742,392,606726,503,0003,011,0002,113,536
8May 18, 2026 17:1322,250744,750,275731,255,0003,008,0002,113,536
9May 18, 2026 17:1322,505754,807,667739,682,0003,014,0002,113,536