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:20highload-churnerhighload-churnerScore: 1,470Success
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:211,46043,824,063102,352,0000360,448
2Oct 19, 2026 03:211,46644,005,820102,854,0000360,448
3Oct 19, 2026 03:211,46644,006,611102,917,0000368,640
4Oct 19, 2026 03:211,46844,059,451103,215,0000360,448
5Oct 19, 2026 03:211,47044,103,852103,217,0000348,160
6Oct 19, 2026 03:211,47344,198,469102,499,0001,014,000368,640
7Oct 19, 2026 03:211,47444,243,676103,448,0000360,448
8Oct 19, 2026 03:211,47644,283,147102,274,0001,035,000364,544
9Oct 19, 2026 03:211,48144,452,382103,991,0000110,592