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 19, 2026 01:42highload-churnerhighload-churnerScore: 1,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2026 01:431,50845,255,079104,959,0001,189,000245,760
2Oct 19, 2026 01:431,58647,603,946107,782,0001,165,000245,760
3Oct 19, 2026 01:431,59047,722,249109,215,0001,010,000241,664
4Oct 19, 2026 01:431,61048,318,255111,532,0001,199,000245,760
5Oct 19, 2026 01:431,61648,489,668112,020,0001,181,000245,760
6Oct 19, 2026 01:431,61648,503,867112,276,0001,165,000245,760
7Oct 19, 2026 01:431,61848,569,723112,966,0001,015,000245,760
8Oct 19, 2026 01:431,62248,687,186110,422,0001,176,000245,760
9Oct 19, 2026 01:431,84255,271,076112,178,0001,210,000245,760