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 16:59Shikhar SoniShikhar SoniScore: 42,196Success
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 17:0042,1351,264,057,3001,198,649,00055,425,0002,113,536
2Jun 26, 2026 17:0042,1491,264,493,9371,198,497,00055,315,0002,113,536
3Jun 26, 2026 17:0042,1611,264,854,8191,199,207,00055,526,0002,113,536
4Jun 26, 2026 17:0042,1751,265,250,9041,199,522,00055,141,0002,113,536
5Jun 26, 2026 17:0042,1961,265,903,2891,199,429,00056,133,0002,113,536
6Jun 26, 2026 17:0042,2131,266,394,0561,200,167,00055,638,0002,113,536
7Jun 26, 2026 17:0042,2191,266,597,8441,200,102,00055,934,0002,113,536
8Jun 26, 2026 17:0042,2321,266,978,7421,201,333,00055,428,0002,113,536
9Jun 26, 2026 17:0042,3321,269,969,6261,204,171,00055,485,0002,113,536