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:19Andrew EpsteinAndrew EpsteinScore: 1,485Success
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:211,45643,694,43899,192,0001,292,0002,170,880stderr
2Oct 31, 2026 07:211,47344,194,908100,822,0001,191,0002,170,880stderr
3Oct 31, 2026 07:211,47944,393,222101,953,0001,107,0002,170,880stderr
4Oct 31, 2026 07:211,48344,505,856102,083,0001,178,0002,170,880stderr
5Oct 31, 2026 07:211,48544,572,263102,140,0001,181,0002,170,880stderr
6Oct 31, 2026 07:211,48644,607,892102,058,0001,119,0002,170,880stderr
7Oct 31, 2026 07:211,49344,794,585102,636,0001,164,0002,170,880stderr
8Oct 31, 2026 07:211,50645,190,509103,703,0001,110,0002,170,880stderr
9Oct 31, 2026 07:211,51545,466,539100,488,0001,180,0002,170,880stderr