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 19, 2026 19:11Andrew EpsteinAndrew EpsteinScore: 39,474Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2026 19:1238,692327,778,899316,256,0001,023,0002,117,632stderr
2Sep 19, 2026 19:1238,859329,908,977317,644,0001,004,0002,117,632stderr
3Sep 19, 2026 19:1239,100331,051,729319,622,0001,003,0002,117,632stderr
4Sep 19, 2026 19:1239,199332,641,747320,432,0001,003,0002,117,632stderr
5Sep 19, 2026 19:1239,474334,096,902322,666,0001,021,0002,117,632stderr
6Sep 19, 2026 19:1239,611335,332,079323,785,0001,029,0002,117,632stderr
7Sep 19, 2026 19:1239,915337,774,670326,302,0001,003,0002,117,632stderr
8Sep 19, 2026 19:1239,921338,048,917326,328,0001,026,0002,117,632stderr
9Sep 19, 2026 19:1240,469342,342,509330,842,0001,005,0002,117,632stderr