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 07:34Andrew EpsteinAndrew EpsteinScore: 1,466Success
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 07:391,44243,287,35498,910,0001,217,0002,150,400stderr
2Oct 31, 2026 07:391,45643,706,719100,297,0001,188,0002,154,496stderr
3Oct 31, 2026 07:391,46343,894,735100,824,0001,178,0002,158,592stderr
4Oct 31, 2026 07:391,46543,951,679100,298,0002,006,0002,150,400stderr
5Oct 31, 2026 07:391,46643,998,111101,601,0001,012,0002,154,496stderr
6Oct 31, 2026 07:391,46744,031,456101,391,0001,032,0002,170,880stderr
7Oct 31, 2026 07:391,48044,415,640102,493,0001,014,0002,162,688stderr
8Oct 31, 2026 07:391,49244,784,573103,349,0001,280,0002,150,400stderr
9Oct 31, 2026 07:391,49744,929,947101,946,0003,053,0002,154,496stderr