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 8, 2026 02:43Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 02:440271,490,995772,577,0007,056,0002,154,496expected "1019482 ", got "1019481 "
2Jun 8, 2026 02:440271,971,708774,829,0006,080,0002,416,640expected "1026425 ", got "1026424 "
3Jun 8, 2026 02:448,782263,461,546748,397,0007,052,0002,416,640
4Jun 8, 2026 02:448,922267,660,964755,605,0007,124,0002,416,640
5Jun 8, 2026 02:448,965268,972,830756,307,0007,178,0002,416,640
6Jun 8, 2026 02:449,023270,693,037770,879,0007,124,0002,428,928
7Jun 8, 2026 02:449,040271,224,279774,580,0006,016,0002,154,496
8Jun 8, 2026 02:449,067272,024,549774,317,0006,005,0002,416,640
9Jun 8, 2026 02:449,084272,541,628776,891,0006,041,0002,416,640