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 listOct 31, 2026 06:19Andrew EpsteinAndrew EpsteinScore: 1,469Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 06:231,45343,591,17699,279,0001,131,0002,170,880stderr
2Oct 31, 2026 06:231,45843,752,85799,420,0001,235,0002,170,880stderr
3Oct 31, 2026 06:231,46143,830,04699,946,0001,024,0002,162,688stderr
4Oct 31, 2026 06:231,46443,929,576100,143,0001,138,0002,162,688stderr
5Oct 31, 2026 06:231,46944,096,746100,649,0001,107,0002,170,880stderr
6Oct 31, 2026 06:231,47144,135,053100,791,0001,130,0002,170,880stderr
7Oct 31, 2026 06:231,47544,254,800100,982,0001,125,0002,170,880stderr
8Oct 31, 2026 06:231,47944,385,680101,919,0001,120,0002,170,880stderr
9Oct 31, 2026 06:231,72651,802,701100,264,0001,149,0002,174,976stderr