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 24, 2026 03:18Victor MerckléVictor MerckléScore: 3,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 03:193,08992,693,071242,312,0003,152,0002,654,208
2Jun 24, 2026 03:193,10693,206,225242,689,0003,176,0002,654,208
3Jun 24, 2026 03:193,10993,293,855243,772,0003,062,0002,654,208
4Jun 24, 2026 03:193,11493,435,145242,919,0003,058,0002,654,208
5Jun 24, 2026 03:193,11993,597,130244,117,0003,069,0002,654,208
6Jun 24, 2026 03:193,12193,653,194243,610,0003,109,0002,654,208
7Jun 24, 2026 03:193,12393,711,755244,799,0003,054,0002,654,208
8Jun 24, 2026 03:193,13394,019,903246,664,0003,146,0002,650,112
9Jun 24, 2026 03:193,20796,235,609248,663,0003,061,0002,650,112