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:43Victor MerckléVictor MerckléScore: 3,908Success
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:443,873116,195,780309,727,0002,221,0002,674,688
2Jun 6, 2026 14:443,876116,286,190317,380,0002,197,0002,678,784
3Jun 6, 2026 14:443,877116,317,924309,200,0002,208,0002,600,960
4Jun 6, 2026 14:443,902117,079,279315,998,0002,189,0002,674,688
5Jun 6, 2026 14:443,908117,247,814313,120,0002,222,0002,674,688
6Jun 6, 2026 14:443,932117,984,981322,046,0002,202,0002,678,784
7Jun 6, 2026 14:443,975119,279,004319,308,0001,183,0002,654,208
8Jun 6, 2026 14:444,143124,298,120336,011,0001,026,0002,453,504
9Jun 6, 2026 14:444,229126,882,829330,435,0001,178,0002,678,784