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 listAug 15, 2026 18:41Tomislav TunkovicTomislav TunkovicScore: 1,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 18:431,77853,351,793125,460,0001,058,00065,536
2Aug 15, 2026 18:431,78153,458,225126,050,0001,108,00065,536
3Aug 15, 2026 18:431,78353,499,897125,296,0001,029,00057,344
4Aug 15, 2026 18:431,79753,914,912126,914,0001,106,00065,536
5Aug 15, 2026 18:431,80254,085,431126,641,0002,125,00065,536
6Aug 15, 2026 18:431,80454,134,900125,972,0002,103,00065,536
7Aug 15, 2026 18:431,81654,488,086128,071,0002,098,00065,536
8Aug 15, 2026 18:431,83355,008,859126,116,0001,097,00065,536
9Aug 15, 2026 18:431,85755,728,466127,967,0001,055,00057,344