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 listMay 20, 2026 19:15M-RochatM-RochatScore: 8,110Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:168,04675,805,69161,890,0004,091,0002,113,536
2May 20, 2026 19:168,05977,983,40762,045,0004,041,0002,113,536
3May 20, 2026 19:168,08175,720,19162,213,0004,053,0002,113,536
4May 20, 2026 19:168,10375,961,56162,388,0004,062,0002,113,536
5May 20, 2026 19:168,11076,130,06562,456,0004,046,0002,113,536
6May 20, 2026 19:168,24577,082,40164,006,0003,610,0002,113,536
7May 20, 2026 19:1620,169176,074,926161,368,0004,023,0002,117,632
8May 20, 2026 19:1620,235175,273,531161,906,0004,023,0002,117,632
9May 20, 2026 19:1620,247177,418,389162,007,0004,020,0002,117,632