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 24, 2025 01:58KeefeKeefeScore: 59,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2025 01:5856,939493,695,708295,936,000170,963,0002,482,176
2Apr 24, 2025 01:5857,305500,196,174292,940,000176,963,0002,482,176
3Apr 24, 2025 01:5857,595496,644,266299,541,000172,735,0002,490,368
4Apr 24, 2025 01:5859,028509,044,381314,368,000169,659,0002,387,968
5Apr 24, 2025 01:5859,601516,272,875315,826,000172,904,0002,437,120
6Apr 24, 2025 01:5859,983519,456,515314,912,000176,950,0002,473,984
7Apr 24, 2025 01:5860,396519,577,464315,519,000179,726,0002,281,472
8Apr 24, 2025 01:5860,833519,877,645325,889,000172,941,0002,433,024
9Apr 24, 2025 01:5861,319534,086,477331,878,000170,937,0002,392,064