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 25, 2026 15:22Dominique GarmierDominique GarmierScore: 28,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 15:2227,894253,334,502226,730,0001,997,0002,289,664
2Mar 25, 2026 15:2228,529256,619,738231,939,0001,999,0002,371,584
3Mar 25, 2026 15:2229,126263,425,232236,836,0001,998,0002,289,664