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 16:48highload-churnerhighload-churnerScore: 15,684Success
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 17:0115,652469,565,479448,231,00010,808,00020,480
2Oct 9, 2026 17:0115,655469,677,670448,469,00010,754,00020,480
3Oct 9, 2026 17:0115,661469,845,284447,801,00010,753,00020,480
4Oct 9, 2026 17:0115,672470,185,684449,070,00010,672,00020,480
5Oct 9, 2026 17:0115,684470,524,887449,197,00010,781,00020,480
6Oct 9, 2026 17:0115,685470,559,531449,366,00010,710,00020,480
7Oct 9, 2026 17:0115,729471,895,863450,616,00010,732,00020,480
8Oct 9, 2026 17:0115,774473,225,126451,841,00010,869,00020,480
9Oct 9, 2026 17:0115,807474,214,472452,945,00010,760,00020,480