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 3, 2026 15:02TudyMTudyMScore: 16,488Success
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 15:1211,291112,225,49190,566,0002,021,0002,494,464
2May 3, 2026 15:1216,417150,307,596133,612,0001,012,0002,441,216
3May 3, 2026 15:1216,420149,836,997132,583,0002,063,0002,461,696
4May 3, 2026 15:1216,472150,517,035133,045,0002,029,0002,387,968
5May 3, 2026 15:1216,488150,801,023133,149,0002,055,0002,535,424
6May 3, 2026 15:1216,543152,482,314133,589,0002,071,0002,465,792
7May 3, 2026 15:1216,582150,743,399133,853,0002,123,0002,486,272
8May 3, 2026 15:1216,629152,969,399134,253,0002,112,0002,326,528
9May 3, 2026 15:1216,694153,129,068134,799,0002,099,0002,498,560