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 listMar 24, 2026 07:16Dominique GarmierDominique GarmierScore: 8,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 07:167,841235,240,104581,424,0009,972,0002,314,240
2Mar 26, 2026 13:067,944238,305,162589,490,00010,990,0002,342,912
3Mar 26, 2026 13:067,956238,693,726583,911,00010,979,0002,338,816
4Mar 24, 2026 07:168,140244,214,941583,884,0008,982,0002,351,104
5Mar 26, 2026 13:068,140244,209,127580,612,00011,011,0002,535,424
6Mar 24, 2026 07:168,171245,115,285608,209,0008,002,0002,351,104