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:33Andrew EpsteinAndrew EpsteinScore: 1,886Success
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:341,47244,177,118101,150,0001,220,0002,162,688stderr
2Oct 31, 2026 07:341,48644,591,26298,862,0001,021,0002,170,880stderr
3Oct 31, 2026 07:341,50045,028,098103,323,0001,077,0002,170,880stderr
4Oct 31, 2026 07:341,80754,238,943108,828,0001,008,0002,162,688stderr
5Oct 31, 2026 07:341,88656,586,817108,030,0004,067,0002,174,976stderr
6Oct 31, 2026 07:341,94858,459,328121,639,0001,245,0002,170,880stderr
7Oct 31, 2026 07:342,00160,045,796120,370,0001,008,0002,170,880stderr
8Oct 31, 2026 07:342,01160,336,862120,665,0002,186,0002,170,880stderr
9Oct 31, 2026 07:342,02760,812,561116,260,0003,048,0002,170,880stderr