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:09highload-churnerhighload-churnerScore: 1,590Success
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:101,50445,132,990105,007,0001,022,000249,856stderr
2Oct 19, 2026 02:101,51145,352,917105,402,0001,012,000249,856stderr
3Oct 19, 2026 02:101,54546,364,931108,628,0001,225,000249,856stderr
4Oct 19, 2026 02:101,57447,243,803111,057,0001,020,000249,856stderr
5Oct 19, 2026 02:101,59047,712,219108,027,0001,008,000258,048stderr
6Oct 19, 2026 02:101,63148,932,820110,244,0001,212,000258,048stderr
7Oct 19, 2026 02:101,63749,114,777112,129,0001,017,000262,144stderr
8Oct 19, 2026 02:101,63849,143,483111,484,0001,010,000262,144stderr
9Oct 19, 2026 02:101,64949,471,986112,587,0001,035,000258,048stderr