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 21:23Victor MerckléVictor MerckléScore: 5,447Success
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 21:245,376161,281,592446,848,0005,379,0002,625,536stderr
2Aug 15, 2026 21:245,381161,440,341448,508,0005,672,0002,621,440stderr
3Aug 15, 2026 21:245,383161,495,537446,728,0005,824,0002,625,536stderr
4Aug 15, 2026 21:245,421162,658,795452,207,0005,672,0002,621,440stderr
5Aug 15, 2026 21:245,447163,415,789455,586,0004,590,0002,621,440stderr
6Aug 15, 2026 21:245,489164,685,786456,093,0005,747,0002,621,440stderr
7Aug 15, 2026 21:245,521165,659,888457,976,0005,554,0002,625,536stderr
8Aug 15, 2026 21:245,532165,975,193459,608,0005,672,0002,621,440stderr
9Aug 15, 2026 21:245,558166,745,889460,176,0005,598,0002,625,536stderr