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 listAug 15, 2026 23:12Victor MerckléVictor MerckléScore: 4,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 23:144,566136,983,885378,422,0003,152,0002,613,248stderr
2Aug 15, 2026 23:144,578137,352,255377,660,0003,030,0002,695,168stderr
3Aug 15, 2026 23:144,608138,264,982382,153,0003,108,0002,654,208stderr
4Aug 15, 2026 23:144,659139,798,081386,169,0003,276,0002,695,168stderr
5Aug 15, 2026 23:144,694140,834,118388,083,0003,127,0002,613,248stderr
6Aug 15, 2026 23:144,702141,078,098388,995,0003,183,0002,695,168stderr
7Aug 15, 2026 23:144,723141,715,301391,864,0003,135,0002,654,208stderr
8Aug 15, 2026 23:144,732141,975,869388,827,0003,040,0002,654,208stderr
9Aug 15, 2026 23:144,744142,349,376390,662,0003,216,0002,613,248stderr