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 06:05Josu San MartinJosu San MartinScore: 3,478Success
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 06:053,469125,843,751113,430,0001,067,0002,113,536
2May 13, 2026 06:053,470123,356,952113,462,0001,074,0002,113,536
3May 13, 2026 06:053,477124,347,514113,686,0001,072,0002,113,536
4May 13, 2026 06:053,478123,536,653113,672,0001,110,0002,113,536
5May 13, 2026 06:053,478124,018,717113,707,0001,080,0002,113,536
6May 13, 2026 06:053,478123,599,133113,674,0001,115,0002,113,536
7May 13, 2026 06:053,480123,619,550113,745,0001,124,0002,113,536
8May 13, 2026 06:053,483124,712,474113,865,0001,105,0002,113,536
9May 13, 2026 06:053,503124,820,854114,470,0001,130,0002,113,536