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:38highload-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:391,45443,639,626102,004,0000606,208
2Nov 8, 2026 05:391,46043,821,970102,572,0000602,112
3Nov 8, 2026 05:391,46143,833,374102,602,0000606,208
4Nov 8, 2026 05:391,46443,940,113102,809,0000606,208
5Nov 8, 2026 05:391,46643,999,162102,872,0000614,400
6Nov 8, 2026 05:391,46643,980,692102,922,0000606,208
7Nov 8, 2026 05:391,49144,731,932102,518,0002,040,000606,208
8Nov 8, 2026 05:391,49944,990,041102,530,0003,033,000606,208
9Nov 8, 2026 05:391,54146,251,525103,017,0000606,208