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:29Andrew EpsteinAndrew EpsteinScore: 1,475Success
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:321,44843,454,87399,004,0001,209,0002,170,880stderr
2Oct 31, 2026 07:321,46243,866,27199,816,0001,169,0002,170,880stderr
3Oct 31, 2026 07:321,46543,950,762100,073,0001,186,0002,170,880stderr
4Oct 31, 2026 07:321,47044,124,579100,751,0001,151,0002,170,880stderr
5Oct 31, 2026 07:321,47544,268,961101,284,0001,124,0002,170,880stderr
6Oct 31, 2026 07:321,48344,502,888101,694,0001,201,0002,170,880stderr
7Oct 31, 2026 07:321,49344,798,485101,803,0002,017,0002,170,880stderr
8Oct 31, 2026 07:321,51445,428,095103,992,0001,260,0002,162,688stderr
9Oct 31, 2026 07:321,52345,701,258100,797,0001,213,0002,170,880stderr