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 19, 2026 09:23Victor MerckléVictor MerckléScore: 3,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 19, 2026 09:243,17295,172,993248,811,0003,145,0002,576,384
2Jun 19, 2026 09:243,17295,162,881249,743,0003,102,0002,580,480
3Jun 19, 2026 09:243,18495,535,051250,572,0003,170,0002,580,480
4Jun 19, 2026 09:243,19395,791,848251,197,0003,149,0002,580,480
5Jun 19, 2026 09:243,19695,890,693249,968,0003,167,0002,580,480
6Jun 19, 2026 09:243,20396,119,305250,920,0003,123,0002,580,480
7Jun 19, 2026 09:243,22096,627,731250,630,0003,113,0002,576,384
8Jun 19, 2026 09:243,22896,846,784252,135,0003,026,0002,576,384
9Jun 19, 2026 09:243,26497,945,532252,558,0003,096,0002,580,480