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:40Andrew EpsteinAndrew EpsteinScore: 1,568Success
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:491,54746,432,134101,181,0002,021,0002,179,072stderr
2Oct 31, 2026 06:491,54846,449,778101,033,0002,046,0002,183,168stderr
3Oct 31, 2026 06:491,54946,471,464101,467,0002,077,0002,183,168stderr
4Oct 31, 2026 06:491,55746,710,532101,382,0002,029,0002,179,072stderr
5Oct 31, 2026 06:491,56847,043,297102,943,0002,001,0002,183,168stderr
6Oct 31, 2026 06:491,57547,265,586104,876,0001,010,0002,179,072stderr
7Oct 31, 2026 06:491,57547,274,582103,754,0002,019,0002,183,168stderr
8Oct 31, 2026 06:491,60148,052,993105,531,0002,010,0002,183,168stderr
9Oct 31, 2026 06:492,02460,727,180109,441,0002,127,0002,183,168stderr