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 19, 2026 01:05Victor MerckléVictor MerckléScore: 3,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 01:063,07792,329,058240,241,0003,107,0002,654,208
2Jun 19, 2026 01:063,08292,467,779242,879,0001,015,0002,650,112
3Jun 19, 2026 01:063,08392,491,363244,532,0001,011,0002,654,208
4Jun 19, 2026 01:063,08692,602,124243,130,0001,031,0002,654,208
5Jun 19, 2026 01:063,09192,748,414242,073,0002,017,0002,654,208
6Jun 19, 2026 01:063,11493,423,529246,710,0001,021,0002,654,208
7Jun 19, 2026 01:063,14594,375,280243,400,0003,151,0002,654,208
8Jun 19, 2026 01:063,16995,089,049247,097,0001,034,0002,650,112
9Jun 19, 2026 01:063,16995,072,614243,553,0003,035,0002,654,208