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 04:35Josu San MartinJosu San MartinScore: 3,523Success
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 04:363,510124,613,825114,779,0001,070,0002,113,536
2May 13, 2026 04:363,516124,869,603114,916,0001,112,0002,113,536
3May 13, 2026 04:363,522126,803,459115,124,0001,131,0002,113,536
4May 13, 2026 04:363,522126,832,433115,097,0001,130,0002,113,536
5May 13, 2026 04:363,523125,023,828115,149,0001,130,0002,113,536
6May 13, 2026 04:363,524126,842,327115,189,0001,119,0002,113,536
7May 13, 2026 04:363,528125,491,286115,435,0001,016,0002,113,536
8May 13, 2026 04:363,529125,525,600115,348,0001,120,0002,113,536
9May 13, 2026 04:363,532127,523,569115,426,0001,133,0002,113,536