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 27, 2026 12:42Dominique GarmierDominique GarmierScore: 26,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 12:4226,617243,155,252216,255,0002,002,0002,277,376
2Mar 27, 2026 12:4226,649242,353,592217,521,0001,002,0002,277,376
3Mar 27, 2026 12:4226,741243,967,960218,272,0001,001,0002,473,984