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 22:53Victor MerckléVictor MerckléScore: 3,064Success
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 22:572,99789,931,843231,954,0003,426,0002,674,688
2Jul 7, 2026 22:573,01890,553,578233,049,0003,102,0002,674,688
3Jul 7, 2026 22:573,01990,593,592233,747,0003,403,0002,670,592
4Jul 7, 2026 22:573,05391,613,590236,113,0003,664,0002,674,688
5Jul 7, 2026 22:573,06491,929,133236,299,0003,343,0002,674,688
6Jul 7, 2026 22:573,06792,013,258236,859,0003,140,0002,674,688
7Jul 7, 2026 22:573,07692,298,042237,765,0003,388,0002,678,784
8Jul 7, 2026 22:573,09292,781,847238,553,0003,420,0002,678,784
9Jul 7, 2026 22:573,09692,886,364239,144,0003,428,0002,670,592