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 20, 2026 15:08BenBenScore: 38,635Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 15:1438,280342,625,884139,957,000173,947,0002,281,472
2Apr 20, 2026 15:1438,635339,624,004146,913,000169,900,0002,289,664
3Apr 20, 2026 15:1439,167348,529,147147,621,000173,555,0002,289,664