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 12, 2026 07:30Haha ExpertHaha ExpertScore: 105,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 07:3076,237633,841,135486,438,000138,712,0002,117,632
2Sep 12, 2026 07:3097,873811,444,079664,393,000138,169,0002,117,632
3Sep 12, 2026 07:30101,259839,129,575690,925,000139,402,0002,117,632
4Sep 12, 2026 07:30101,785843,217,603696,175,000138,469,0002,117,632
5Sep 12, 2026 07:30105,821876,407,890731,506,000136,232,0002,117,632
6Sep 12, 2026 07:30113,966943,940,760798,265,000136,259,0002,117,632
7Sep 12, 2026 07:30120,616998,546,965850,498,000138,558,0002,117,632
8Sep 12, 2026 07:30128,6811,063,812,249919,124,000136,064,0002,117,632
9Sep 12, 2026 07:30133,9651,108,110,789959,333,000139,183,0002,117,632