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:55Andrew EpsteinAndrew EpsteinScore: 1,498Success
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:581,48344,497,96999,773,0003,067,0002,162,688stderr
2Oct 31, 2026 07:581,48644,602,147101,482,0002,330,0002,162,688stderr
3Oct 31, 2026 07:581,49644,887,869102,654,0002,058,0002,158,592stderr
4Oct 31, 2026 07:581,49744,926,658102,308,0002,043,0002,162,688stderr
5Oct 31, 2026 07:581,49844,959,453102,180,0002,047,0002,158,592stderr
6Oct 31, 2026 07:581,50345,098,251103,732,0001,023,0002,162,688stderr
7Oct 31, 2026 07:581,50345,102,721101,598,0003,022,0002,162,688stderr
8Oct 31, 2026 07:581,50645,181,669104,233,0001,229,0002,162,688stderr
9Oct 31, 2026 07:581,56847,041,573103,041,0003,010,0002,158,592stderr