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 listOct 9, 2026 10:21highload-churnerhighload-churnerScore: 14,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 10:2314,060474,463,334453,417,00010,575,00020,480
2Oct 9, 2026 10:2314,123476,532,703455,443,00010,620,00020,480
3Oct 9, 2026 10:2314,167478,044,883456,779,00010,750,00020,480
4Oct 9, 2026 10:2314,197479,045,403457,863,00010,664,00020,480
5Oct 9, 2026 10:2314,241480,389,333459,350,00010,624,00020,480
6Oct 9, 2026 10:2314,284481,806,126460,740,00010,637,00020,480
7Oct 9, 2026 10:2314,373484,880,558463,625,00010,709,00020,480
8Oct 9, 2026 10:2314,393485,371,269463,874,00011,119,00020,480
9Oct 9, 2026 10:2314,692495,231,734473,527,00011,339,00020,480