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 17, 2026 02:20M-RochatM-RochatScore: 21,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:2221,251637,555,433622,750,0003,270,0002,113,536
2May 17, 2026 02:2221,370641,103,573628,064,0003,009,0002,113,536
3May 17, 2026 02:2221,376641,282,829627,678,0003,370,0002,113,536
4May 17, 2026 02:2221,391641,754,066627,697,0003,393,0002,113,536
5May 17, 2026 02:2221,400642,027,451627,313,0003,012,0002,113,536
6May 17, 2026 02:2221,493644,808,164629,998,0003,011,0002,113,536
7May 17, 2026 02:2221,670650,100,041636,215,0003,015,0002,113,536
8May 17, 2026 02:2221,750652,514,474635,428,0003,282,0002,113,536
9May 17, 2026 02:2222,045661,374,739647,001,0003,398,0002,113,536