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 19, 2026 01:12highload-churnerhighload-churnerScore: 1,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 01:131,63349,013,497113,003,0003,744,000245,760stderr
2Oct 19, 2026 01:131,64649,393,419114,149,0003,769,000245,760stderr
3Oct 19, 2026 01:131,65049,529,769114,428,0003,767,000241,664stderr
4Oct 19, 2026 01:131,66149,851,191114,706,0003,853,000245,760stderr
5Oct 19, 2026 01:131,66950,094,586116,037,0003,769,000245,760stderr
6Oct 19, 2026 01:131,70451,120,354118,186,0004,378,000241,664stderr
7Oct 19, 2026 01:131,71851,541,325119,464,0004,385,000245,760stderr
8Oct 19, 2026 01:131,72651,798,731120,432,0003,477,000258,048stderr
9Oct 19, 2026 01:131,75352,606,956122,399,0003,490,000258,048stderr