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 12, 2026 03:02highload-churnerhighload-churnerScore: 10,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2026 03:0310,723321,691,831268,476,00042,758,00020,480
2Oct 12, 2026 03:0310,739322,197,955268,664,00043,017,00020,480
3Oct 12, 2026 03:0310,745322,370,539268,264,00043,268,00020,480
4Oct 12, 2026 03:0310,751322,559,511269,891,00042,112,00020,480
5Oct 12, 2026 03:0310,757322,729,259270,198,00042,003,00020,480
6Oct 12, 2026 03:0310,769323,078,823269,701,00042,873,00020,480
7Oct 12, 2026 03:0310,773323,201,651269,845,00042,906,00020,480
8Oct 12, 2026 03:0310,775323,273,486270,850,00041,951,00020,480
9Oct 12, 2026 03:0311,063331,896,837278,558,00042,863,00020,480