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 26, 2026 00:23Victor MerckléVictor MerckléScore: 2,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 00:242,89886,962,816232,289,0003,049,0002,658,304
2Jun 26, 2026 00:242,90487,148,222232,974,0003,122,0002,654,208
3Jun 26, 2026 00:242,90787,231,250234,133,0003,090,0002,658,304
4Jun 26, 2026 00:242,91087,305,170234,939,0002,110,0002,658,304
5Jun 26, 2026 00:242,92187,644,670236,834,0001,014,0002,658,304
6Jun 26, 2026 00:242,93187,931,207236,333,0002,121,0002,654,208
7Jun 26, 2026 00:242,93488,020,321236,060,0003,022,0002,654,208
8Jun 26, 2026 00:242,95488,632,939237,530,0002,189,0002,654,208
9Jun 26, 2026 00:243,03991,195,152240,399,0002,107,0002,654,208