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 30, 2026 19:24TonyTonyScore: 30,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2026 19:2530,608918,256,476853,418,00053,641,0002,138,112
2Jul 30, 2026 19:2530,626918,808,466854,256,00053,692,0002,138,112
3Jul 30, 2026 19:2530,626918,787,841853,220,00053,956,0002,138,112
4Jul 30, 2026 19:2530,880926,407,319859,746,00055,412,0002,138,112
5Jul 30, 2026 19:2530,882926,487,378859,542,00055,810,0002,138,112
6Jul 30, 2026 19:2530,911927,341,071858,563,00056,526,0002,138,112
7Jul 30, 2026 19:2530,918927,557,712859,841,00056,443,0002,138,112
8Jul 30, 2026 19:2530,933928,015,477860,011,00056,159,0002,138,112
9Jul 30, 2026 19:2530,940928,217,387861,208,00055,916,0002,138,112