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 listSep 4, 2026 07:59Victor MerckléVictor MerckléScore: 1,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 08:061,93458,048,741143,623,0001,271,0002,170,880stderr
2Sep 4, 2026 08:061,94158,254,052142,584,0002,023,0002,170,880stderr
3Sep 4, 2026 08:061,94558,371,141144,018,0001,273,0002,170,880stderr
4Sep 4, 2026 08:061,95958,798,203145,718,0001,219,0002,170,880stderr
5Sep 4, 2026 08:061,96058,822,397144,923,0001,014,0002,170,880stderr
6Sep 4, 2026 08:061,96258,889,009145,252,0001,008,0002,170,880stderr
7Sep 4, 2026 08:061,97059,114,590145,781,0001,095,0002,170,880stderr
8Sep 4, 2026 08:061,97259,171,816145,742,0001,008,0002,170,880stderr
9Sep 4, 2026 08:062,00560,178,113145,292,0001,267,0002,170,880stderr