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 listJun 26, 2026 04:05Victor MerckléVictor MerckléScore: 2,903Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 04:062,85485,643,454228,309,0003,193,0002,658,304stderr
2Jun 26, 2026 04:062,86685,981,181229,268,0003,150,0002,658,304stderr
3Jun 26, 2026 04:062,87486,249,027230,415,0003,109,0002,662,400stderr
4Jun 26, 2026 04:062,90087,021,750229,087,0003,120,0002,662,400stderr
5Jun 26, 2026 04:062,90387,096,811233,086,0003,033,0002,662,400stderr
6Jun 26, 2026 04:062,90687,198,729235,318,0001,010,0002,662,400stderr
7Jun 26, 2026 04:062,91787,523,815233,494,0003,140,0002,662,400stderr
8Jun 26, 2026 04:062,91887,553,518236,563,0001,037,0002,662,400stderr
9Jun 26, 2026 04:062,96488,933,073235,052,0003,027,0002,658,304stderr