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 listSep 2, 2026 10:25C#_userC#_userScore: 126,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 10:28108,185896,962,139709,656,000177,466,0002,142,208
2Sep 2, 2026 10:28110,881919,334,359733,118,000176,111,0002,142,208
3Sep 2, 2026 10:28125,4671,038,622,955850,274,000178,556,0002,142,208
4Sep 2, 2026 10:28125,6741,040,379,646850,580,000179,949,0002,142,208
5Sep 2, 2026 10:28126,0281,043,290,290857,286,000176,145,0002,138,112
6Sep 2, 2026 10:28128,5591,063,978,569876,666,000177,519,0002,142,208
7Sep 2, 2026 10:28129,2771,072,854,203881,544,000178,532,0002,203,648
8Sep 2, 2026 10:28131,8171,090,698,547902,212,000178,693,0002,142,208
9Sep 2, 2026 10:28137,9191,140,684,246954,518,000176,425,0002,142,208