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 12:09highload-churnerhighload-churnerScore: 6,360Success
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 12:106,313189,395,425508,656,00016,179,000507,904
2Oct 16, 2026 12:106,319189,582,975509,003,00016,035,000507,904
3Oct 16, 2026 12:106,327189,832,870509,770,00016,081,000495,616
4Oct 16, 2026 12:106,345190,365,571508,246,00017,620,000499,712
5Oct 16, 2026 12:106,360190,826,040510,282,00017,146,000507,904
6Oct 16, 2026 12:106,395191,850,361508,889,00014,233,000507,904
7Oct 16, 2026 12:106,397191,937,500507,424,00016,158,000495,616
8Oct 16, 2026 12:106,425192,765,520506,889,00014,678,000507,904
9Oct 16, 2026 12:106,446193,403,988508,526,00015,266,000503,808