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 03:39Victor MerckléVictor MerckléScore: 3,537Success
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 03:403,468104,068,421285,665,0002,003,0002,658,304
2Jun 26, 2026 03:403,490104,700,103288,046,0001,020,0002,658,304
3Jun 26, 2026 03:403,493104,798,124286,621,0003,056,0002,658,304
4Jun 26, 2026 03:403,497104,917,595286,199,0003,094,0002,658,304
5Jun 26, 2026 03:403,537106,127,031292,678,0001,011,0002,658,304
6Jun 26, 2026 03:403,540106,229,964291,439,0002,039,0002,416,640
7Jun 26, 2026 03:403,551106,557,013291,209,0003,171,0002,658,304
8Jun 26, 2026 03:403,557106,716,424288,352,0003,138,0002,658,304
9Jun 26, 2026 03:403,610108,326,482293,487,0002,115,0002,658,304