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:51highload-churnerhighload-churnerScore: 1,492Success
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:521,48244,461,019103,771,0000339,968stderr
2Oct 19, 2026 02:521,48444,522,042104,142,0000364,544stderr
3Oct 19, 2026 02:521,48744,624,270104,318,0000335,872stderr
4Oct 19, 2026 02:521,49244,763,625104,577,0000339,968stderr
5Oct 19, 2026 02:521,49244,777,103104,805,0000380,928stderr
6Oct 19, 2026 02:521,49544,874,384104,785,0000380,928stderr
7Oct 19, 2026 02:521,50145,039,319105,510,0000339,968stderr
8Oct 19, 2026 02:521,50445,140,684104,870,0001,016,000364,544stderr
9Oct 19, 2026 02:521,54746,434,835103,826,0001,043,000360,448stderr