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:35highload-churnerhighload-churnerScore: 1,471Success
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:361,45843,742,168102,115,0000360,448
2Oct 19, 2026 03:361,46243,863,755102,427,0000368,640
3Oct 19, 2026 03:361,46443,926,630102,700,0000368,640
4Oct 19, 2026 03:361,46443,940,961101,410,0001,030,000364,544
5Oct 19, 2026 03:361,47144,131,693103,286,0000368,640
6Oct 19, 2026 03:361,47944,399,825101,598,0002,024,000360,448
7Oct 19, 2026 03:361,49244,768,589103,094,0002,025,000233,472
8Oct 19, 2026 03:361,56046,803,871102,005,0003,139,000368,640
9Oct 19, 2026 03:361,57747,339,576103,766,0003,104,000360,448