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 13, 2026 14:01highload-churnerhighload-churnerScore: 2,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 14:032,70298,206,22688,022,0001,161,00020,480
2Oct 13, 2026 14:032,71798,640,70888,483,0001,185,00020,480
3Oct 13, 2026 14:032,73299,092,19688,988,0001,168,00020,480
4Oct 13, 2026 14:032,73799,391,23889,146,0001,182,00020,480
5Oct 13, 2026 14:032,737100,760,08089,176,0001,175,00020,480
6Oct 13, 2026 14:032,74399,581,28489,350,0001,180,00020,480
7Oct 13, 2026 14:032,75899,991,05689,854,0001,174,00020,480
8Oct 13, 2026 14:032,770100,363,13690,223,0001,193,00020,480
9Oct 13, 2026 14:032,802101,562,26291,255,0001,239,00020,480