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 06:56marko1597marko1597Score: 7,937Success
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 06:577,909237,270,093221,676,0007,346,0002,121,728stderr
2Aug 17, 2026 06:577,920237,600,112221,967,0007,345,0002,121,728stderr
3Aug 17, 2026 06:577,923237,710,320222,186,0007,331,0002,121,728stderr
4Aug 17, 2026 06:577,929237,884,625221,490,0007,314,0002,121,728stderr
5Aug 17, 2026 06:577,937238,130,421222,415,0007,306,0002,121,728stderr
6Aug 17, 2026 06:577,946238,391,682222,727,0007,320,0002,121,728stderr
7Aug 17, 2026 06:577,970239,112,986222,730,0007,309,0002,121,728stderr
8Aug 17, 2026 06:577,973239,199,178222,681,0007,321,0002,121,728stderr
9Aug 17, 2026 06:577,978239,363,559222,271,0007,281,0002,121,728stderr