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 01:31Victor MerckléVictor MerckléScore: 4,706Success
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 01:324,648139,445,097256,188,0003,286,0002,654,208
2Jun 26, 2026 01:324,653139,616,427251,258,0004,469,0002,658,304
3Jun 26, 2026 01:324,674140,231,003252,025,0003,454,0002,658,304
4Jun 26, 2026 01:324,682140,469,761252,428,0002,172,0002,658,304
5Jun 26, 2026 01:324,706141,192,613252,435,0003,411,0002,396,160
6Jun 26, 2026 01:324,707141,225,874251,249,0004,522,0002,654,208
7Jun 26, 2026 01:324,775143,275,154255,313,0004,452,0002,658,304
8Jun 26, 2026 01:324,811144,344,923262,147,0003,263,0002,387,968
9Jun 26, 2026 01:324,817144,528,422256,315,0004,307,0002,658,304