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 9, 2026 22:01Victor MerckléVictor MerckléScore: 3,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 22:083,15194,556,680245,396,0002,229,0002,142,208
2Jun 9, 2026 22:083,17195,146,848248,733,0001,034,0002,142,208
3Jun 9, 2026 22:083,17795,321,024246,619,0001,071,0002,142,208
4Jun 9, 2026 22:083,19495,821,526249,985,0001,033,0002,142,208
5Jun 9, 2026 22:083,20296,080,339250,808,0001,048,0002,142,208
6Jun 9, 2026 22:083,20496,127,529252,532,0001,031,0002,142,208
7Jun 9, 2026 22:083,20896,257,703251,267,0001,031,0002,142,208
8Jun 9, 2026 22:083,21896,548,092253,581,0001,023,0002,142,208
9Jun 9, 2026 22:083,22896,862,615253,753,0001,036,0002,142,208