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 04:33Andrew EpsteinAndrew EpsteinScore: 1,547Success
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 04:341,50045,010,695103,303,0001,165,0002,166,784
2Oct 31, 2026 04:341,50145,046,066103,759,0001,132,0002,166,784
3Oct 31, 2026 04:341,50445,127,458104,286,0001,176,0002,166,784
4Oct 31, 2026 04:341,51045,322,117104,785,0001,030,0002,158,592
5Oct 31, 2026 04:341,54746,437,916107,755,0001,251,0002,166,784
6Oct 31, 2026 04:341,56246,862,949109,270,0001,138,0002,158,592
7Oct 31, 2026 04:341,81254,367,355113,729,0001,222,0002,166,784
8Oct 31, 2026 04:341,90357,091,397109,193,0001,259,0002,166,784
9Oct 31, 2026 04:341,95258,573,836114,976,0001,199,0002,158,592