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 13, 2026 00:11Josu San MartinJosu San MartinScore: 3,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 00:113,905139,003,711127,827,0001,064,0002,113,536
2May 13, 2026 00:113,910137,991,053127,977,0001,070,0002,113,536
3May 13, 2026 00:113,910138,042,083127,978,0001,079,0002,113,536
4May 13, 2026 00:113,911137,994,355127,998,0001,072,0002,113,536
5May 13, 2026 00:113,916138,971,464128,139,0001,118,0002,113,536
6May 13, 2026 00:113,917138,103,930128,161,0001,114,0002,113,536
7May 13, 2026 00:113,921138,248,720128,288,0001,125,0002,113,536
8May 13, 2026 00:113,925138,814,360128,412,0001,121,0002,113,536
9May 13, 2026 00:113,938140,762,412128,845,0001,119,0002,113,536