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 7, 2026 23:30Victor MerckléVictor MerckléScore: 3,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 23:322,97189,150,646231,790,0003,239,0002,707,456stderr
2Jul 7, 2026 23:322,99889,942,651233,650,0003,246,0002,711,552stderr
3Jul 7, 2026 23:323,00790,219,188235,059,0003,199,0002,711,552stderr
4Jul 7, 2026 23:323,03791,128,735234,080,0003,168,0002,711,552stderr
5Jul 7, 2026 23:323,04791,430,315236,244,0003,254,0002,711,552stderr
6Jul 7, 2026 23:323,05091,504,346233,359,0003,219,0002,711,552stderr
7Jul 7, 2026 23:323,06291,873,363231,528,0004,524,0002,707,456stderr
8Jul 7, 2026 23:323,07392,192,278236,033,0003,289,0002,711,552stderr
9Jul 7, 2026 23:323,07992,387,377236,064,0003,179,0002,711,552stderr