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 28, 2026 02:12Victor MerckléVictor MerckléScore: 3,039Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 02:142,96188,842,152229,402,0003,325,0002,707,456
2Jun 28, 2026 02:142,96588,957,370229,980,0003,249,0002,707,456
3Jun 28, 2026 02:142,97589,261,589230,813,0003,273,0002,703,360
4Jun 28, 2026 02:143,00590,153,290231,665,0003,224,0002,707,456
5Jun 28, 2026 02:143,03991,176,727231,912,0003,252,0002,707,456
6Jun 28, 2026 02:143,04091,224,839232,421,0003,225,0002,707,456
7Jun 28, 2026 02:143,04491,344,297231,842,0003,344,0002,707,456
8Jun 28, 2026 02:143,05891,753,453231,312,0003,259,0002,707,456
9Jun 28, 2026 02:143,07392,200,624230,908,0003,183,0002,707,456