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 06:47Andrew EpsteinAndrew EpsteinScore: 1,480Success
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 06:511,44443,345,59898,619,0001,135,0002,170,880stderr
2Oct 31, 2026 06:511,46944,081,349100,634,0001,032,0002,170,880stderr
3Oct 31, 2026 06:511,47144,146,779100,847,0001,180,0002,162,688stderr
4Oct 31, 2026 06:511,47244,175,149101,100,0001,032,0002,170,880stderr
5Oct 31, 2026 06:511,48044,416,690101,449,0001,121,0002,170,880stderr
6Oct 31, 2026 06:511,48344,517,376102,409,0001,010,0002,162,688stderr
7Oct 31, 2026 06:511,48444,535,839102,146,0001,090,0002,170,880stderr
8Oct 31, 2026 06:511,48544,554,887102,005,0001,240,0002,170,880stderr
9Oct 31, 2026 06:511,49444,830,634102,953,0001,032,0002,162,688stderr