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 5, 2026 14:47Victor MerckléVictor MerckléScore: 5,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 14:495,805174,159,310483,081,0009,299,0002,691,072
2Jun 5, 2026 14:495,854175,643,376485,663,0009,055,0002,572,288
3Jun 5, 2026 14:495,885176,563,973492,127,0009,197,0002,629,632
4Jun 5, 2026 14:495,907177,228,276485,625,0009,706,0002,637,824
5Jun 5, 2026 14:495,966178,994,099485,927,00010,553,0002,568,192
6Jun 5, 2026 14:495,981179,450,067492,652,0009,857,0002,568,192
7Jun 5, 2026 14:496,011180,354,821491,747,0009,800,0002,555,904
8Jun 5, 2026 14:496,031180,938,496497,283,0009,177,0002,617,344
9Jun 5, 2026 14:496,109183,287,783492,982,0008,881,0002,568,192