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 9, 2026 18:56highload-churnerhighload-churnerScore: 12,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 18:5812,151364,540,947305,781,00047,808,00020,480
2Oct 9, 2026 18:5812,544376,321,418316,954,00048,779,00020,480
3Oct 9, 2026 18:5812,640379,200,702319,276,00049,398,00020,480
4Oct 9, 2026 18:5812,675380,275,852320,732,00048,971,00020,480
5Oct 9, 2026 18:5812,679380,374,776320,902,00048,975,00020,480
6Oct 9, 2026 18:5812,700381,004,865321,003,00049,471,00020,480
7Oct 9, 2026 18:5812,734382,042,569322,307,00049,153,00020,480
8Oct 9, 2026 18:5812,829384,878,769325,530,00048,819,00020,480
9Oct 9, 2026 18:5812,964388,947,898329,446,00049,002,00020,480