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 listMar 14, 2026 20:49Elijah KinElijah KinScore: 94,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 20:4987,137742,020,689524,650,000189,873,0002,297,856
2Mar 14, 2026 20:4993,608790,685,105587,685,000179,903,0002,420,736
3Mar 14, 2026 20:4993,668795,442,062575,307,000192,767,0002,314,240
4Mar 14, 2026 20:4994,035797,933,249565,333,000205,757,0002,277,376
5Mar 14, 2026 20:4994,396800,354,086567,303,000206,746,0002,306,048
6Mar 14, 2026 20:4997,890829,584,947619,764,000182,930,0002,277,376
7Mar 14, 2026 20:49100,132851,556,419629,299,000191,786,0002,301,952
8Mar 14, 2026 20:49101,662858,400,773643,715,000189,916,0002,306,048
9Mar 14, 2026 20:49127,6831,077,248,977853,189,000193,815,0002,519,040