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 23:18Victor MerckléVictor MerckléScore: 1,726Success
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 23:391,70051,024,844121,110,0002,013,0002,170,880stderr
2Sep 4, 2026 23:391,71351,409,032121,956,0002,031,0002,170,880stderr
3Sep 4, 2026 23:391,71851,545,976120,875,0001,020,0002,170,880stderr
4Sep 4, 2026 23:391,72351,690,802120,481,0001,029,0002,170,880stderr
5Sep 4, 2026 23:391,72651,790,550121,552,0001,022,0002,170,880stderr
6Sep 4, 2026 23:391,73151,955,185121,374,0002,022,0002,170,880stderr
7Sep 4, 2026 23:391,73151,942,174122,173,0001,029,0002,170,880stderr
8Sep 4, 2026 23:391,73151,937,309121,561,0002,017,0002,170,880stderr
9Sep 4, 2026 23:391,74252,283,907121,335,0001,033,0002,170,880stderr