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 31, 2026 06:34Andrew EpsteinAndrew EpsteinScore: 1,473Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 06:391,45543,656,77799,438,0001,199,0002,150,400stderr
2Oct 31, 2026 06:391,46643,993,78298,453,0003,105,0002,154,496stderr
3Oct 31, 2026 06:391,47044,105,719101,218,0001,191,0002,150,400stderr
4Oct 31, 2026 06:391,47144,152,659101,221,0001,199,0002,154,496stderr
5Oct 31, 2026 06:391,47344,215,307101,394,0001,011,0002,154,496stderr
6Oct 31, 2026 06:391,47944,376,272101,969,0001,143,0002,154,496stderr
7Oct 31, 2026 06:391,48844,640,183102,596,0001,035,0002,150,400stderr
8Oct 31, 2026 06:391,48944,675,325102,781,0001,013,0002,162,688stderr
9Oct 31, 2026 06:391,51245,382,880104,850,0001,016,0002,154,496stderr