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 05:34Dominique GarmierDominique GarmierScore: 14,468Success
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 05:344,86066,400,42236,866,0002,989,0002,519,040
2Mar 24, 2026 05:3414,468145,212,864116,645,0001,993,0002,506,752
3Mar 24, 2026 05:3414,746149,858,995119,919,000999,0002,445,312