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 6, 2026 14:53Victor MerckléVictor MerckléScore: 3,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 14:543,542106,281,972280,701,0002,179,0002,142,208
2Jun 6, 2026 14:543,550106,519,925280,967,0002,153,0002,142,208
3Jun 6, 2026 14:543,550106,521,661282,250,0001,034,0002,142,208
4Jun 6, 2026 14:543,552106,566,897280,644,0002,141,0002,142,208
5Jun 6, 2026 14:543,554106,645,011280,073,0001,146,0002,146,304
6Jun 6, 2026 14:543,566106,980,469282,948,0001,003,0002,142,208
7Jun 6, 2026 14:543,569107,078,558283,128,0001,013,0002,142,208
8Jun 6, 2026 14:543,585107,555,329283,166,0002,161,0002,142,208
9Jun 6, 2026 14:543,615108,475,197281,906,0001,162,0002,146,304