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 18, 2026 05:53Victor MerckléVictor MerckléScore: 3,197Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 05:543,17695,282,435249,432,0003,057,0002,654,208
2Jun 18, 2026 05:543,18095,416,067249,724,0003,138,0002,654,208
3Jun 18, 2026 05:543,18495,521,392249,769,0003,113,0002,654,208
4Jun 18, 2026 05:543,18895,663,647251,924,0001,027,0002,654,208
5Jun 18, 2026 05:543,19795,921,157252,964,0001,024,0002,654,208
6Jun 18, 2026 05:543,21296,363,417252,181,0003,034,0002,650,112
7Jun 18, 2026 05:543,24597,356,729252,010,0003,104,0002,654,208
8Jun 18, 2026 05:543,26297,876,587252,934,0003,078,0002,654,208
9Jun 18, 2026 05:543,26998,087,213256,812,00002,654,208