Median Sergey Svistunov

Find the median of a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listJun 21, 2026 10:53Victor MerckléVictor MerckléScore: 11,536Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2026 10:5411,459103,105,48391,944,0002,027,0002,117,632stderr
2Jun 21, 2026 10:5411,467103,119,74892,012,0002,019,0002,117,632stderr
3Jun 21, 2026 10:5411,467103,116,01492,003,0002,028,0002,117,632stderr
4Jun 21, 2026 10:5411,479103,261,34092,084,0002,045,0002,117,632stderr
5Jun 21, 2026 10:5411,536103,796,13592,587,0002,014,0002,117,632stderr
6Jun 21, 2026 10:5411,560103,927,73692,692,0002,106,0002,117,632stderr
7Jun 21, 2026 10:5411,582104,083,07592,935,0002,041,0002,117,632stderr
8Jun 21, 2026 10:5411,647104,642,30593,443,0002,069,0002,117,632stderr
9Jun 21, 2026 10:5411,842107,502,15294,796,0002,309,0002,117,632stderr