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 02:42highload-churnerhighload-churnerScore: 1,512Success
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 02:441,49344,807,323104,448,0000376,832stderr
2Oct 19, 2026 02:441,49444,848,297103,622,0001,013,000364,544stderr
3Oct 19, 2026 02:441,49844,968,285105,407,0000356,352stderr
4Oct 19, 2026 02:441,50045,023,692104,254,0001,019,000360,448stderr
5Oct 19, 2026 02:441,51245,362,001105,162,0001,019,000360,448stderr
6Oct 19, 2026 02:441,54846,440,305105,149,0000344,064stderr
7Oct 19, 2026 02:441,92757,816,056108,699,0003,014,000344,064stderr
8Oct 19, 2026 02:442,01160,344,320119,055,0001,015,000225,280stderr
9Oct 19, 2026 02:442,06061,827,868123,373,0001,025,000364,544stderr