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 08:05Andrew EpsteinAndrew EpsteinScore: 1,477Success
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 08:131,45843,769,912100,303,0001,032,0002,154,496stderr
2Oct 31, 2026 08:131,46043,805,252100,097,0001,023,0002,154,496stderr
3Oct 31, 2026 08:131,46543,966,334100,475,0001,203,0002,150,400stderr
4Oct 31, 2026 08:131,47144,132,707101,199,0001,011,0002,162,688stderr
5Oct 31, 2026 08:131,47744,321,279101,095,0001,292,0002,154,496stderr
6Oct 31, 2026 08:131,48744,622,623101,404,0001,282,0002,154,496stderr
7Oct 31, 2026 08:131,49144,731,670101,473,0001,269,0002,150,400stderr
8Oct 31, 2026 08:131,49744,929,80599,091,0001,155,0002,150,400stderr
9Oct 31, 2026 08:131,50845,246,169103,107,0001,016,0002,166,784stderr