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 24, 2026 04:03Dominique GarmierDominique GarmierScore: 12,471Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 04:0312,411128,341,64599,772,0001,995,0002,392,064
2Mar 24, 2026 04:0312,471128,418,949100,258,0002,005,0002,355,200
3Mar 24, 2026 04:0312,505135,847,54198,516,0004,021,0002,441,216