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 1, 2026 17:08Victor MerckléVictor MerckléScore: 3,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 17:093,60647,040,60326,513,0003,059,0002,543,616
2May 1, 2026 17:093,64743,739,93227,914,0001,993,0002,408,448
3May 1, 2026 17:093,66552,714,08627,051,0003,005,0002,416,640
4May 1, 2026 17:093,69853,680,09027,294,0003,032,0002,420,736
5May 1, 2026 17:093,75446,263,04628,800,0001,986,0002,326,528
6May 1, 2026 17:0913,808127,517,663109,220,0004,008,0002,473,984
7May 1, 2026 17:0913,835130,483,928110,436,0003,011,0002,506,752
8May 1, 2026 17:0913,965133,765,470111,502,0003,013,0002,461,696
9May 1, 2026 17:0914,060133,458,346112,293,0003,007,0002,465,792