Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 19, 2026 03:42highload-churnerhighload-churnerScore: 1,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 19, 2026 03:431,46343,915,267101,444,0001,019,000364,544
2Oct 19, 2026 03:431,46643,999,137102,728,0000364,544
3Oct 19, 2026 03:431,46644,009,865102,684,0000360,448
4Oct 19, 2026 03:431,46644,008,649102,792,0000368,640
5Oct 19, 2026 03:431,46844,040,901102,816,0000360,448
6Oct 19, 2026 03:431,47144,147,027101,954,0001,014,000364,544
7Oct 19, 2026 03:431,47444,223,107103,202,0000364,544
8Oct 19, 2026 03:431,47544,251,087103,442,0000364,544
9Oct 19, 2026 03:431,47744,321,989103,625,0000360,448