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 16, 2026 08:35M-RochatM-RochatScore: 32,111Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:3931,998959,946,774937,930,00012,642,0002,113,536
2May 16, 2026 08:3932,029960,871,233938,906,00013,071,0002,113,536
3May 16, 2026 08:3932,052961,573,149939,726,00012,873,0002,113,536
4May 16, 2026 08:3932,088962,656,667939,669,00012,744,0002,113,536
5May 16, 2026 08:3932,111963,333,983939,135,00013,003,0002,113,536
6May 16, 2026 08:3932,112963,370,325941,529,00012,910,0002,113,536
7May 16, 2026 08:3932,123963,711,231939,475,00012,740,0002,113,536
8May 16, 2026 08:3932,127963,817,815941,658,00013,042,0002,113,536
9May 16, 2026 08:3932,177965,321,681940,680,00014,601,0002,113,536