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 listApr 17, 2026 10:16olliecrowolliecrowScore: 77,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 10:1677,956667,358,123639,236,00002,506,752
2Apr 17, 2026 10:1677,978669,048,658635,422,0003,996,0002,461,696
3Apr 17, 2026 10:1677,979667,667,358637,427,0001,998,0002,482,176