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:34M-RochatM-RochatScore: 31,813Success
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:3531,694950,847,340928,890,00012,724,0002,113,536
2May 16, 2026 08:3531,695950,866,066929,152,00012,852,0002,113,536
3May 16, 2026 08:3531,745952,367,097928,773,00012,615,0002,113,536
4May 16, 2026 08:3531,812954,376,061929,664,00012,914,0002,113,536
5May 16, 2026 08:3531,813954,417,099930,685,00013,148,0002,113,536
6May 16, 2026 08:3531,828954,862,070931,044,00013,172,0002,113,536
7May 16, 2026 08:3531,844955,331,644932,942,00013,532,0002,113,536
8May 16, 2026 08:3531,845955,368,405933,526,00013,161,0002,113,536
9May 16, 2026 08:3531,882956,476,459931,782,00012,916,0002,113,536