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 17, 2026 03:33highload-churnerhighload-churnerScore: 6,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 03:346,303189,110,684506,494,00016,163,000503,808
2Oct 17, 2026 03:346,311189,349,288507,288,00016,184,000507,904
3Oct 17, 2026 03:346,334190,045,086506,757,00017,690,000495,616
4Oct 17, 2026 03:346,340190,222,694507,191,00017,518,000499,712
5Oct 17, 2026 03:346,358190,744,357507,574,00016,081,000495,616
6Oct 17, 2026 03:346,366190,986,687504,494,00015,086,000503,808
7Oct 17, 2026 03:346,367191,019,949505,433,00014,303,000507,904
8Oct 17, 2026 03:346,373191,213,994506,278,00014,246,000507,904
9Oct 17, 2026 03:346,807204,236,386527,618,00014,279,000503,808