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 18, 2026 01:56M-RochatM-RochatScore: 21,869Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:5720,823624,717,899610,545,0004,011,0002,113,536
2May 18, 2026 01:5720,840625,221,957611,385,0004,094,0002,113,536
3May 18, 2026 01:5720,935628,052,572611,580,0004,146,0002,113,536
4May 18, 2026 01:5721,797653,913,074638,405,0004,127,0002,113,536
5May 18, 2026 01:5721,869656,071,309641,956,0004,013,0002,113,536
6May 18, 2026 01:5721,892656,781,625643,284,0004,057,0002,113,536
7May 18, 2026 01:5721,902657,071,804642,344,0004,015,0002,113,536
8May 18, 2026 01:5721,936658,084,721642,857,0004,100,0002,113,536
9May 18, 2026 01:5721,959658,796,600643,409,0004,031,0002,113,536