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:47highload-churnerhighload-churnerScore: 1,474Success
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:481,45643,703,377100,914,0001,012,000372,736
2Oct 19, 2026 03:481,46243,879,544101,337,0001,021,000364,544
3Oct 19, 2026 03:481,46744,037,715102,901,0000360,448
4Oct 19, 2026 03:481,47244,163,712103,312,0000360,448
5Oct 19, 2026 03:481,47444,224,634102,221,0001,007,000364,544
6Oct 19, 2026 03:481,47644,304,095103,367,0000360,448
7Oct 19, 2026 03:481,47744,317,566102,800,0001,011,000360,448
8Oct 19, 2026 03:481,47944,381,834102,633,0000360,448
9Oct 19, 2026 03:481,48844,655,173101,645,0003,085,000360,448