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 9, 2026 19:26highload-churnerhighload-churnerScore: 19,997Success
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 19:2819,863595,902,419534,007,00050,712,00057,344
2Oct 9, 2026 19:2819,927597,834,668531,983,00054,528,00057,344
3Oct 9, 2026 19:2819,960598,828,836536,875,00050,640,00053,248
4Oct 9, 2026 19:2819,980599,425,561538,113,00050,090,00053,248
5Oct 9, 2026 19:2819,997599,911,922536,134,00052,438,00057,344
6Oct 9, 2026 19:2820,007600,232,777536,844,00051,881,00057,344
7Oct 9, 2026 19:2820,075602,262,596537,599,00053,319,00045,056
8Oct 9, 2026 19:2820,092602,787,130539,067,00052,429,00053,248
9Oct 9, 2026 19:2820,245607,371,221536,150,00057,159,00057,344