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 03:24highload-churnerhighload-churnerScore: 1,480Success
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 03:251,46744,036,247102,871,0000360,448
2Oct 19, 2026 03:251,47544,271,776103,278,0000368,640
3Oct 19, 2026 03:251,47644,299,412102,869,0001,013,000364,544
4Oct 19, 2026 03:251,47644,287,554103,684,0000360,448
5Oct 19, 2026 03:251,48044,428,190104,055,0000368,640
6Oct 19, 2026 03:251,48144,452,016103,047,0001,012,000372,736
7Oct 19, 2026 03:251,51845,566,329101,819,0001,039,000364,544
8Oct 19, 2026 03:251,53846,153,083106,465,0000360,448
9Oct 19, 2026 03:251,57647,302,589103,499,0000225,280