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 14:02highload-churnerhighload-churnerScore: 22,754Success
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 14:0522,516675,503,136649,660,00014,332,00057,344
2Oct 9, 2026 14:0522,644679,340,490652,988,00014,389,00057,344
3Oct 9, 2026 14:0522,698680,965,588654,436,00015,156,00057,344
4Oct 9, 2026 14:0522,741682,250,139656,576,00014,315,00057,344
5Oct 9, 2026 14:0522,754682,631,207655,876,00015,425,00057,344
6Oct 9, 2026 14:0522,754682,644,543656,047,00015,263,00057,344
7Oct 9, 2026 14:0522,759682,790,849657,310,00014,291,00057,344
8Oct 9, 2026 14:0522,781683,450,787657,287,00014,380,00057,344
9Oct 9, 2026 14:0522,833684,996,506658,664,00014,363,00057,344