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 27, 2026 14:49Victor MerckléVictor MerckléScore: 2,861Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 14:502,84785,410,503226,876,0003,168,0002,658,304
2Jun 27, 2026 14:502,84785,437,382227,639,0003,147,0002,658,304
3Jun 27, 2026 14:502,85085,509,870229,798,0001,013,0002,654,208
4Jun 27, 2026 14:502,85885,741,056228,221,0003,067,0002,658,304
5Jun 27, 2026 14:502,86185,851,468228,679,0003,085,0002,654,208
6Jun 27, 2026 14:502,90787,215,483228,572,0003,042,0002,658,304
7Jun 27, 2026 14:502,91287,375,048231,810,00002,654,208
8Jun 27, 2026 14:502,93187,934,154232,336,0001,007,0002,658,304
9Jun 27, 2026 14:502,94488,336,793231,061,0003,075,0002,658,304