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 26, 2026 04:20Victor MerckléVictor MerckléScore: 2,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 04:212,89186,730,293234,511,0001,030,0002,658,304
2Jun 26, 2026 04:212,90587,168,443232,874,0003,174,0002,658,304
3Jun 26, 2026 04:212,93988,196,029235,720,0003,147,0002,654,208
4Jun 26, 2026 04:212,97289,187,296239,626,0003,113,0002,412,544
5Jun 26, 2026 04:212,97389,194,616236,441,0003,060,0002,658,304
6Jun 26, 2026 04:212,98589,562,746237,387,0003,166,0002,658,304
7Jun 26, 2026 04:213,00890,266,385239,376,0003,048,0002,658,304
8Jun 26, 2026 04:213,01090,321,975238,269,0003,076,0002,654,208
9Jun 26, 2026 04:213,01390,400,405237,732,0003,083,0002,658,304