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 listMar 4, 2026 03:23olliecrowolliecrowScore: 10,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 03:239,868296,029,503754,239,0009,950,0002,445,312
2Mar 4, 2026 03:239,959298,774,066772,789,00010,997,0002,387,968
3Mar 4, 2026 03:239,990299,692,893773,659,00010,980,0002,396,160
4Mar 4, 2026 03:239,990299,696,714768,658,00011,009,0002,498,560
5Mar 4, 2026 03:2310,028300,839,860773,935,0008,987,0002,498,560
6Mar 4, 2026 03:2310,098302,945,042775,147,0009,001,0002,424,832
7Mar 4, 2026 03:2310,141304,243,847771,187,00010,002,0002,404,352
8Mar 4, 2026 03:2310,154304,610,107772,433,0009,979,0002,392,064
9Mar 4, 2026 03:2310,246307,367,031768,340,00011,019,0002,523,136