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 03:19Andrew EpsteinAndrew EpsteinScore: 1,501Success
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 03:201,49944,980,923102,830,0001,192,0002,158,592
2Oct 31, 2026 03:201,49944,989,368103,443,0001,132,0002,158,592
3Oct 31, 2026 03:201,50145,057,286102,798,0001,245,0002,166,784
4Oct 31, 2026 03:201,50145,054,475101,538,0001,192,0002,166,784
5Oct 31, 2026 03:201,50145,030,442103,409,0001,253,0002,166,784
6Oct 31, 2026 03:201,51345,401,753104,004,0001,243,0002,166,784
7Oct 31, 2026 03:201,52545,760,495104,838,0001,220,0002,166,784
8Oct 31, 2026 03:201,52645,795,916105,901,0001,195,0002,166,784
9Oct 31, 2026 03:201,53646,099,686105,914,0001,290,0002,166,784