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 28, 2026 19:22Dominique GarmierDominique GarmierScore: 101,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 19:22100,486847,950,819689,155,000134,834,0002,281,472
2Mar 28, 2026 19:22101,218852,944,205697,150,000132,838,0002,273,280
3Mar 28, 2026 19:22104,226881,588,811712,714,000141,943,0002,465,792