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 listJan 11, 2026 19:53Josu San MartinJosu San MartinScore: 4,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2026 19:534,583137,479,630318,857,0002,998,0002,625,536
2Jan 11, 2026 16:074,679140,375,650318,063,0003,988,0002,818,048
3Jan 11, 2026 16:074,697140,914,654314,787,0003,997,0002,715,648
4Jan 11, 2026 19:534,700140,986,735317,858,0002,998,0002,789,376
5Jan 11, 2026 16:074,823144,687,532316,497,0004,006,0002,682,880
6Jan 11, 2026 19:534,831144,919,009316,423,0005,989,0002,830,336