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 9, 2026 19:25highload-churnerhighload-churnerScore: 16,555Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 19:2616,464493,924,826475,906,0006,074,00024,576
2Oct 9, 2026 19:2616,522495,672,228480,338,0004,284,00024,576
3Oct 9, 2026 19:2616,528495,845,022478,722,0006,053,00032,768
4Oct 9, 2026 19:2616,553496,617,461481,281,0004,235,00024,576
5Oct 9, 2026 19:2616,555496,676,190481,340,0004,328,00024,576
6Oct 9, 2026 19:2616,594497,849,034480,599,0006,090,00024,576
7Oct 9, 2026 19:2616,620498,627,927481,754,0004,257,00032,768
8Oct 9, 2026 19:2616,668500,046,640482,177,0006,146,00024,576
9Oct 9, 2026 19:2616,696500,887,809483,145,0006,105,00024,576