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 00:00Victor MerckléVictor MerckléScore: 3,017Success
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 00:012,94488,325,042237,335,0001,047,0002,654,208
2Jun 26, 2026 00:012,95088,512,257235,819,0003,179,0002,650,112
3Jun 26, 2026 00:012,95188,554,085235,991,0003,243,0002,654,208
4Jun 26, 2026 00:012,95788,737,677236,252,0003,170,0002,646,016
5Jun 26, 2026 00:013,01790,518,431239,990,0003,173,0002,654,208
6Jun 26, 2026 00:013,04691,401,932239,238,0003,125,0002,646,016
7Jun 26, 2026 00:013,05091,512,196239,372,0003,177,0002,654,208
8Jun 26, 2026 00:013,08592,555,138244,733,0001,121,0002,658,304
9Jun 26, 2026 00:013,10793,236,128243,886,0003,115,0002,641,920