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:34highload-churnerhighload-churnerScore: 17,555Success
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:3517,454523,624,514508,316,0004,249,00024,576
2Oct 9, 2026 19:3517,493524,790,630507,426,0006,237,00024,576
3Oct 9, 2026 19:3517,538526,169,386508,648,0006,287,00036,864
4Oct 9, 2026 19:3517,549526,497,824511,075,0004,267,00024,576
5Oct 9, 2026 19:3517,555526,660,248511,282,0004,258,00024,576
6Oct 9, 2026 19:3517,574527,232,991510,111,0006,085,00032,768
7Oct 9, 2026 19:3517,590527,710,587512,381,0004,237,00024,576
8Oct 9, 2026 19:3517,602528,069,837511,534,0005,318,00045,056
9Oct 9, 2026 19:3517,618528,568,881510,711,0006,129,00024,576