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:25Victor 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 11, 2026 15:25098,367,925246,667,0007,126,0002,662,400expected "1025999 ", got "1025998 "
2Jun 11, 2026 15:253,18195,430,372244,180,0006,193,0002,662,400
3Jun 11, 2026 15:253,22196,635,162245,801,0006,089,0002,650,112
4Jun 11, 2026 15:253,22296,671,576244,554,0007,040,0002,666,496
5Jun 11, 2026 15:253,23697,109,111246,244,0007,059,0002,670,592
6Jun 11, 2026 15:253,24297,279,123249,021,0004,033,0002,666,496
7Jun 11, 2026 15:253,26597,965,123250,639,0005,104,0002,670,592
8Jun 11, 2026 15:253,26798,024,847247,141,0007,119,0002,670,592
9Jun 11, 2026 15:253,28898,663,394252,736,0005,177,0002,650,112