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 11, 2026 15:35Victor MerckléVictor MerckléScore: 3,129Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 15:363,08092,422,949240,741,0003,449,0002,654,208
2Jun 11, 2026 15:363,10193,037,034240,941,0003,433,0002,658,304
3Jun 11, 2026 15:363,11393,406,492243,013,0003,508,0002,654,208
4Jun 11, 2026 15:363,12693,787,730244,965,0003,468,0002,658,304
5Jun 11, 2026 15:363,12993,889,877244,741,0003,500,0002,654,208
6Jun 11, 2026 15:363,14094,220,431242,645,0003,447,0002,658,304
7Jun 11, 2026 15:363,15794,732,257246,671,0003,454,0002,654,208
8Jun 11, 2026 15:363,18195,448,098247,100,0001,160,0002,396,160
9Jun 11, 2026 15:363,18795,636,165246,706,0001,106,0002,658,304