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 26, 2026 19:16Dominique GarmierDominique GarmierScore: 10,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 26, 2026 19:1610,119111,039,79480,977,0001,999,0002,408,448
2Mar 26, 2026 19:1610,123107,085,17881,007,0002,000,0002,473,984
3Mar 26, 2026 19:1610,165105,719,76981,349,0002,008,0002,371,584