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 7, 2026 03:50Victor MerckléVictor MerckléScore: 6,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 03:526,550196,506,128552,819,0009,289,0002,600,960
2Jun 7, 2026 03:526,645199,351,981559,730,00010,188,0002,605,056
3Jun 7, 2026 03:526,676200,291,823564,462,0009,008,0002,600,960
4Jun 7, 2026 03:526,686200,590,326564,912,0009,528,0002,600,960
5Jun 7, 2026 03:526,699200,990,120566,784,0009,278,0002,600,960
6Jun 7, 2026 03:526,700201,012,951566,731,0009,241,0002,600,960
7Jun 7, 2026 03:526,835205,051,325578,578,0009,049,0002,600,960
8Jun 7, 2026 03:526,916207,503,774586,929,0008,940,0002,600,960
9Jun 7, 2026 03:526,967209,013,596589,838,0009,616,0002,600,960