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 10, 2026 22:16olliecrowolliecrowScore: 18,567Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 22:163,36248,500,92626,548,0001,021,0002,494,464
2Mar 10, 2026 22:1618,567176,638,855149,247,0003,004,0002,433,024
3Mar 10, 2026 22:1618,658183,055,985148,995,0003,999,0002,445,312