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 16, 2026 00:44zielajzielajScore: 5,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 00:442,76647,710,59522,683,00002,506,752
2Apr 16, 2026 00:442,78944,020,70721,876,000994,0002,502,656
3Apr 16, 2026 00:445,28465,270,23443,329,00002,445,312
4Apr 16, 2026 00:445,30967,345,84543,535,00002,265,088
5Apr 16, 2026 00:445,34067,827,82342,795,000995,0002,297,856
6Apr 16, 2026 00:445,34273,621,72642,807,000995,0002,412,544