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 07:07olliecrowolliecrowScore: 11,675Success
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 07:1711,629348,893,010330,803,0003,187,0002,555,904
2May 5, 2026 07:1711,631348,946,788329,814,0003,147,0002,555,904
3May 5, 2026 07:1711,673350,209,444331,100,0003,220,0002,568,192
4May 5, 2026 07:1711,673350,194,889330,495,0003,156,0002,560,000
5May 5, 2026 07:1711,675350,258,896330,090,0003,364,0002,564,096
6May 5, 2026 07:1711,729351,870,838332,720,0003,386,0002,564,096
7May 5, 2026 07:1711,738352,144,822332,713,0003,381,0002,568,192
8May 5, 2026 07:1711,745352,359,301333,239,0003,233,0002,564,096
9May 5, 2026 07:1711,779353,373,917330,653,0003,222,0002,555,904