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 17, 2026 04:50marko1597marko1597Score: 10,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 05:1410,281308,454,727288,317,00011,752,0002,121,728stderr
2Aug 17, 2026 05:1410,301309,054,033288,715,00011,979,0002,121,728stderr
3Aug 17, 2026 05:1410,316309,490,876289,169,00011,987,0002,121,728stderr
4Aug 17, 2026 05:1410,317309,511,681289,131,00012,025,0002,121,728stderr
5Aug 17, 2026 05:1410,349310,481,401290,395,00011,793,0002,121,728stderr
6Aug 17, 2026 05:1410,369311,087,587290,660,00012,252,0002,121,728stderr
7Aug 17, 2026 05:1410,369311,078,585290,722,00012,014,0002,121,728stderr
8Aug 17, 2026 05:1410,475314,251,646293,389,00011,831,0002,121,728stderr
9Aug 17, 2026 05:1411,226336,789,899316,645,00011,785,0002,121,728stderr