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 5, 2026 14:54Victor MerckléVictor MerckléScore: 5,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2026 14:555,671170,134,650466,138,00011,725,0002,498,560
2Jun 5, 2026 14:555,697170,919,100467,939,00010,972,0002,494,464
3Jun 5, 2026 14:555,704171,142,798471,665,0009,974,0002,498,560
4Jun 5, 2026 14:555,722171,688,394467,481,00011,684,0002,502,656
5Jun 5, 2026 14:555,728171,841,103473,807,00010,072,0002,494,464
6Jun 5, 2026 14:555,741172,251,233470,105,00011,401,0002,494,464
7Jun 5, 2026 14:555,751172,548,299470,631,0009,246,0002,342,912
8Jun 5, 2026 14:555,813174,397,856472,306,0009,950,0002,506,752
9Jun 5, 2026 14:555,921177,658,423479,588,00010,289,0002,322,432