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 14, 2026 23:02Josu San MartinJosu San MartinScore: 4,306Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 23:034,294151,202,923140,722,0001,008,0002,113,536
2May 14, 2026 23:034,294151,002,718140,716,0001,007,0002,113,536
3May 14, 2026 23:034,296151,068,228140,777,0001,009,0002,113,536
4May 14, 2026 23:034,302153,637,015140,985,0001,010,0002,113,536
5May 14, 2026 23:034,306152,964,583141,114,0001,008,0002,113,536
6May 14, 2026 23:034,306152,623,703141,100,0001,009,0002,113,536
7May 14, 2026 23:034,310153,901,945141,245,0001,006,0002,113,536
8May 14, 2026 23:034,311151,731,681141,288,0001,006,0002,113,536
9May 14, 2026 23:034,324153,598,125141,693,0001,007,0002,113,536