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 18, 2026 04:52Josu San MartinJosu San MartinScore: 4,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 04:534,575137,261,621193,912,0004,052,0002,146,304
2Aug 18, 2026 04:534,587137,625,188194,684,0003,108,0002,146,304
3Aug 18, 2026 04:534,597137,911,240195,512,0003,018,0002,146,304
4Aug 18, 2026 04:534,602138,083,022195,677,0003,074,0002,146,304
5Aug 18, 2026 04:534,614138,429,060194,843,0004,236,0002,146,304
6Aug 18, 2026 04:534,615138,454,598195,425,0004,106,0002,146,304
7Aug 18, 2026 04:534,654139,642,823195,183,0004,034,0002,146,304
8Aug 18, 2026 04:534,664139,926,364195,995,0003,061,0002,146,304
9Aug 18, 2026 04:534,684140,534,941197,492,0004,032,0002,146,304