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 listJul 8, 2026 12:29Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 12:33090,691,064234,212,0003,355,0002,674,688expected "1026027 ", got "1026026 "
2Jul 8, 2026 12:333,02690,786,083234,892,0003,403,0002,674,688
3Jul 8, 2026 12:333,03591,058,873232,513,0003,703,0002,740,224
4Jul 8, 2026 12:333,03691,086,129233,931,0003,642,0002,674,688
5Jul 8, 2026 12:333,03991,183,231234,568,0003,352,0002,674,688
6Jul 8, 2026 12:333,04491,339,626235,768,0003,455,0002,674,688
7Jul 8, 2026 12:333,04891,444,276236,026,0003,397,0002,674,688
8Jul 8, 2026 12:333,05091,513,334235,651,0003,334,0002,670,592
9Jul 8, 2026 12:333,08792,633,610238,791,0003,369,0002,674,688