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 27, 2026 22:41TudyMTudyMScore: 17,484Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:5017,433159,309,013141,957,000999,0002,363,392
2Apr 27, 2026 22:5017,449162,820,812141,085,0002,001,0002,297,856
3Apr 27, 2026 22:5017,449161,581,196141,082,0002,001,0002,367,488
4Apr 27, 2026 22:5017,457165,596,784142,150,0001,001,0002,371,584
5Apr 27, 2026 22:5017,484159,326,775141,368,0002,005,0002,453,504
6Apr 27, 2026 22:5017,526162,064,872140,726,0002,994,0002,363,392
7Apr 27, 2026 22:5017,555169,751,964140,955,0002,999,0002,363,392
8Apr 27, 2026 22:5017,568162,084,862141,057,0003,001,0002,371,584
9Apr 27, 2026 22:5017,581163,455,691143,165,0001,001,0002,367,488