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 listJun 5, 2026 15:51Victor MerckléVictor MerckléScore: 5,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 15:525,226156,809,344431,005,0007,999,0002,596,864
2Jun 5, 2026 15:525,227156,817,952431,139,0009,768,0002,592,768
3Jun 5, 2026 15:525,229156,899,437432,694,0008,709,0002,600,960
4Jun 5, 2026 15:525,244157,331,574428,876,0009,614,0002,596,864
5Jun 5, 2026 15:525,250157,521,716431,037,0008,955,0002,600,960
6Jun 5, 2026 15:525,257157,724,279433,162,0008,806,0002,596,864
7Jun 5, 2026 15:525,319159,593,736435,740,0008,762,0002,596,864
8Jun 5, 2026 15:525,326159,788,017426,677,0009,857,0002,600,960
9Jun 5, 2026 15:525,393161,805,922440,407,0008,700,0002,596,864