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 3, 2026 19:18TudyMTudyMScore: 30,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 19:2230,392911,783,891887,192,0008,030,0002,539,520
2May 3, 2026 19:2230,448913,459,015886,364,00010,024,0002,539,520
3May 3, 2026 19:2230,462913,870,097887,915,0009,915,0002,551,808
4May 3, 2026 19:2230,501915,042,624886,706,0009,985,0002,560,000
5May 3, 2026 19:2230,579917,393,136892,892,00010,015,0002,555,904
6May 3, 2026 19:2230,626918,792,091893,392,00010,972,0002,547,712
7May 3, 2026 19:2230,635919,078,434886,893,00011,055,0002,547,712
8May 3, 2026 19:2230,680920,411,862893,904,00010,043,0002,551,808
9May 3, 2026 19:2231,238937,140,063911,100,00011,102,0002,560,000