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 19:52highload-churnerhighload-churnerScore: 12,631Success
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 19:5311,857355,710,388298,002,00046,678,00053,248
2Oct 9, 2026 19:5312,397371,925,491312,964,00048,037,00053,248
3Oct 9, 2026 19:5312,414372,427,610312,415,00049,401,00057,344
4Oct 9, 2026 19:5312,609378,273,723318,508,00049,039,00020,480
5Oct 9, 2026 19:5312,631378,938,557319,226,00049,242,00020,480
6Oct 9, 2026 19:5312,726381,804,425321,541,00049,778,00020,480
7Oct 9, 2026 19:5312,730381,928,886319,721,00050,037,00020,480
8Oct 9, 2026 19:5312,756382,684,968322,222,00049,961,00020,480
9Oct 9, 2026 19:5312,927387,833,665327,919,00049,337,00020,480