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 08:14highload-churnerhighload-churnerScore: 14,468Success
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 09:0814,134477,000,237455,683,00010,769,00020,480
2Oct 9, 2026 09:0814,323483,261,019461,949,00010,731,00020,480
3Oct 9, 2026 09:0814,375484,847,894463,704,00010,684,00020,480
4Oct 9, 2026 09:0814,417486,293,593464,368,00011,414,00020,480
5Oct 9, 2026 09:0814,468487,976,404466,328,00011,120,00020,480
6Oct 9, 2026 09:0814,470488,429,376466,775,00010,755,00020,480
7Oct 9, 2026 09:0814,571491,338,946470,108,00010,759,00020,480
8Oct 9, 2026 09:0814,602492,321,014470,681,00011,204,00020,480
9Oct 9, 2026 09:0814,670494,505,404472,950,00011,181,00020,480