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 4, 2026 00:59olliecrowolliecrowScore: 12,230Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:5912,216123,472,95297,163,0003,005,0002,457,600
2Mar 4, 2026 00:5912,230123,064,18898,281,0002,005,0002,412,544
3Mar 4, 2026 00:5912,269127,742,80498,612,0001,992,0002,453,504