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 8, 2026 03:13Victor MerckléVictor MerckléScore: 3,201Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 03:143,15194,539,293245,364,0002,263,0002,654,208
2Jun 8, 2026 03:143,19095,701,165251,160,0001,020,0002,674,688
3Jun 8, 2026 03:143,19495,844,129250,449,0002,194,0002,674,688
4Jun 8, 2026 03:143,19695,885,677252,121,0001,011,0002,674,688
5Jun 8, 2026 03:143,20196,040,958250,821,0002,205,0002,674,688
6Jun 8, 2026 03:143,20296,075,848249,946,0002,169,0002,674,688
7Jun 8, 2026 03:143,21596,471,081251,865,0002,217,0002,674,688
8Jun 8, 2026 03:143,23096,919,349251,955,0001,160,0002,678,784
9Jun 8, 2026 03:143,23597,069,356257,213,0001,013,0002,674,688