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 listNov 8, 2026 05:09highload-churnerhighload-churnerScore: 1,466Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 8, 2026 05:101,45443,644,963101,890,0000610,304
2Nov 8, 2026 05:101,45643,680,205101,964,0000618,496
3Nov 8, 2026 05:101,46443,940,476102,752,0000610,304
4Nov 8, 2026 05:101,46443,930,967102,921,0000610,304
5Nov 8, 2026 05:101,46643,988,011102,865,0000610,304
6Nov 8, 2026 05:101,47844,349,041102,073,0002,036,000606,208
7Nov 8, 2026 05:101,48544,558,647102,625,0002,072,000610,304
8Nov 8, 2026 05:101,49344,814,291103,227,0002,050,000610,304
9Nov 8, 2026 05:101,49344,800,059102,352,0003,049,000610,304