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 9, 2026 21:10Victor MerckléVictor MerckléScore: 3,265Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 21:173,23196,951,042253,954,0001,080,0002,138,112
2Jun 9, 2026 21:173,25497,642,315253,820,0002,327,0002,138,112
3Jun 9, 2026 21:173,25797,729,039257,098,0001,093,0002,142,208
4Jun 9, 2026 21:173,25997,783,021255,506,0002,304,0002,138,112
5Jun 9, 2026 21:173,26597,965,328255,782,0001,090,0002,138,112
6Jun 9, 2026 21:173,27898,350,567256,476,0002,375,0002,138,112
7Jun 9, 2026 21:173,28698,588,668258,587,0001,103,0002,138,112
8Jun 9, 2026 21:173,29098,701,118258,529,0001,087,0002,138,112
9Jun 9, 2026 21:173,31499,436,153247,928,0001,261,0002,142,208