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 11:59Victor MerckléVictor MerckléScore: 3,053Success
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:023,00990,281,206233,053,0003,659,0002,674,688
2Jul 8, 2026 12:023,01790,525,754232,972,0003,099,0002,678,784
3Jul 8, 2026 12:023,01990,593,381232,668,0003,334,0002,674,688
4Jul 8, 2026 12:023,04791,411,979234,515,0003,702,0002,674,688
5Jul 8, 2026 12:023,05391,608,359237,154,0003,106,0002,674,688
6Jul 8, 2026 12:023,05491,644,884235,987,0003,634,0002,674,688
7Jul 8, 2026 12:023,06792,017,533236,938,0003,451,0002,674,688
8Jul 8, 2026 12:023,08792,623,112237,352,0003,402,0002,674,688
9Jul 8, 2026 12:023,09692,909,994239,597,0003,654,0002,674,688