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 24, 2026 03:41Victor MerckléVictor MerckléScore: 3,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 03:423,17495,241,022243,397,0003,123,0002,658,304stderr
2Jun 24, 2026 03:423,19095,701,596245,088,0003,097,0002,658,304stderr
3Jun 24, 2026 03:423,21596,464,023247,750,0003,105,0002,658,304stderr
4Jun 24, 2026 03:423,23096,911,064246,674,0003,151,0002,658,304stderr
5Jun 24, 2026 03:423,23397,009,105250,767,0002,040,0002,658,304stderr
6Jun 24, 2026 03:423,25697,699,367250,382,0003,217,0002,658,304stderr
7Jun 24, 2026 03:423,29598,879,258249,450,0003,095,0002,658,304stderr
8Jun 24, 2026 03:423,30999,279,493249,353,0003,100,0002,658,304stderr
9Jun 24, 2026 03:423,33399,992,140252,023,0003,140,0002,658,304stderr