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 7, 2026 04:22Victor MerckléVictor MerckléScore: 3,158Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 04:233,11293,362,096243,483,0002,231,0002,142,208
2Jun 7, 2026 04:233,13694,100,330245,256,0002,149,0002,142,208
3Jun 7, 2026 04:233,14494,344,247245,037,0002,230,0002,142,208
4Jun 7, 2026 04:233,15094,506,497245,635,0002,302,0002,146,304
5Jun 7, 2026 04:233,15894,758,291246,316,0002,190,0002,142,208
6Jun 7, 2026 04:233,17995,387,975245,641,0002,184,0002,142,208
7Jun 7, 2026 04:233,18895,651,251247,728,0002,282,0002,146,304
8Jun 7, 2026 04:233,19595,867,350248,144,0002,201,0002,142,208
9Jun 7, 2026 04:233,19995,971,187247,535,0002,346,0002,146,304