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:40Andrew EpsteinAndrew EpsteinScore: 1,480Success
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:491,46844,046,885100,816,0001,113,0002,150,400stderr
2Oct 31, 2026 09:491,46844,042,916100,596,0001,156,0002,150,400stderr
3Oct 31, 2026 09:491,46944,086,691100,894,0001,039,0002,170,880stderr
4Oct 31, 2026 09:491,47244,184,973101,311,0001,012,0002,154,496stderr
5Oct 31, 2026 09:491,48044,416,731101,816,0001,163,0002,162,688stderr
6Oct 31, 2026 09:491,49944,977,913103,169,0001,285,0002,170,880stderr
7Oct 31, 2026 09:491,50545,164,628104,126,0001,032,0002,154,496stderr
8Oct 31, 2026 09:491,52145,637,481100,631,0001,224,0002,154,496stderr
9Oct 31, 2026 09:491,58347,496,919102,541,0001,269,0002,170,880stderr