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 16, 2026 11:12highload-churnerhighload-churnerScore: 6,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 11:136,852205,583,640504,887,00010,060,000143,360
2Oct 16, 2026 11:136,856205,703,178505,469,00010,038,000151,552
3Oct 16, 2026 11:136,869206,083,836505,001,00010,003,000147,456
4Oct 16, 2026 11:136,878206,343,121504,494,00010,036,000147,456
5Oct 16, 2026 11:136,882206,480,054503,738,00010,036,000155,648
6Oct 16, 2026 11:136,896206,908,813504,587,0009,987,000147,456
7Oct 16, 2026 11:136,962208,868,436507,914,00010,069,000147,456
8Oct 16, 2026 11:137,200216,012,028509,277,0009,984,000151,552
9Oct 16, 2026 11:137,417222,520,743510,465,0009,972,000151,552