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:16highload-churnerhighload-churnerScore: 1,487Success
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:171,47744,313,422101,764,0002,068,000368,640stderr
2Oct 19, 2026 03:171,48044,416,231101,836,0002,122,000229,376stderr
3Oct 19, 2026 03:171,48444,521,849102,288,0002,047,000368,640stderr
4Oct 19, 2026 03:171,48644,606,977102,417,0002,019,000360,448stderr
5Oct 19, 2026 03:171,48744,623,854103,511,0001,034,000376,832stderr
6Oct 19, 2026 03:171,49344,802,174103,045,0002,046,000360,448stderr
7Oct 19, 2026 03:171,49444,822,143101,990,0003,053,000372,736stderr
8Oct 19, 2026 03:171,49644,905,311103,015,0002,061,000364,544stderr
9Oct 19, 2026 03:171,50045,025,498104,741,0001,041,000364,544stderr