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 09:37Andrew EpsteinAndrew EpsteinScore: 1,460Success
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 09:431,43643,097,33097,951,0001,125,0002,154,496stderr
2Oct 31, 2026 09:431,44643,401,90098,857,0001,143,0002,154,496stderr
3Oct 31, 2026 09:431,44743,413,73498,578,0001,250,0002,154,496stderr
4Oct 31, 2026 09:431,45743,718,45299,800,0001,122,0002,150,400stderr
5Oct 31, 2026 09:431,46043,828,604100,290,0001,148,0002,170,880stderr
6Oct 31, 2026 09:431,46443,926,311100,435,0001,014,0002,154,496stderr
7Oct 31, 2026 09:431,46443,938,778100,486,0001,136,0002,150,400stderr
8Oct 31, 2026 09:431,47144,131,443100,745,0001,205,0002,162,688stderr
9Oct 31, 2026 09:431,52445,748,311100,856,0001,211,0002,154,496stderr