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 listMay 5, 2026 01:33olliecrowolliecrowScore: 11,749Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 01:3411,378341,345,231323,781,0003,323,0002,564,096
2May 5, 2026 01:3411,666349,990,874330,539,0003,342,0002,568,192
3May 5, 2026 01:3411,681350,444,341331,369,0003,165,0002,564,096
4May 5, 2026 01:3411,698350,949,378330,443,0003,369,0002,564,096
5May 5, 2026 01:3411,749352,491,181331,536,0003,221,0002,564,096
6May 5, 2026 01:3411,787353,629,465330,323,0003,200,0002,576,384
7May 5, 2026 01:3411,792353,763,837331,735,0003,401,0002,572,288
8May 5, 2026 01:3411,840355,223,424332,511,0003,428,0002,572,288
9May 5, 2026 01:3411,968359,058,702339,801,0003,421,0002,572,288