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:45highload-churnerhighload-churnerScore: 1,486Success
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:461,46243,887,766101,517,0001,014,000364,544
2Oct 19, 2026 03:461,46643,990,429102,741,0000360,448
3Oct 19, 2026 03:461,47144,150,553103,398,0000364,544
4Oct 19, 2026 03:461,47144,131,435103,153,0000368,640
5Oct 19, 2026 03:461,48644,584,805101,488,0003,129,000360,448
6Oct 19, 2026 03:461,49844,957,388102,618,0003,080,000368,640
7Oct 19, 2026 03:461,51145,337,740102,546,0003,121,000368,640
8Oct 19, 2026 03:461,52245,660,496103,102,0000360,448
9Oct 19, 2026 03:461,59847,952,726102,137,0003,129,000225,280