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:27highload-churnerhighload-churnerScore: 1,473Success
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:281,46643,991,230101,806,0001,012,000364,544
2Oct 19, 2026 03:281,46944,079,995101,957,0001,014,000364,544
3Oct 19, 2026 03:281,47044,114,125103,214,0000360,448
4Oct 19, 2026 03:281,47044,100,722103,293,0000372,736
5Oct 19, 2026 03:281,47344,213,519102,179,0001,019,000364,544
6Oct 19, 2026 03:281,47444,231,540103,095,0000225,280
7Oct 19, 2026 03:281,48544,555,483104,209,0000360,448
8Oct 19, 2026 03:281,48744,617,458102,070,0001,016,000364,544
9Oct 19, 2026 03:281,49344,803,337103,308,0002,052,000339,968