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 25, 2026 23:43Victor MerckléVictor MerckléScore: 2,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 23:442,91787,523,771235,001,00002,654,208
2Jun 25, 2026 23:442,92387,701,588234,055,0002,172,0002,654,208
3Jun 25, 2026 23:442,92687,803,703232,784,0002,075,0002,658,304
4Jun 25, 2026 23:442,93187,956,713235,898,0002,182,0002,658,304
5Jun 25, 2026 23:442,93287,978,019233,478,0003,180,0002,658,304
6Jun 25, 2026 23:442,93688,085,155235,441,0002,154,0002,658,304
7Jun 25, 2026 23:442,94388,294,405235,128,0002,173,0002,658,304
8Jun 25, 2026 23:442,94388,312,669238,786,00002,658,304
9Jun 25, 2026 23:443,00090,029,412236,780,0002,063,0002,654,208