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 listDec 9, 2024 00:08Hayden DonnellyHayden DonnellyScore: 102,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 00:0888,665749,054,367535,301,000191,749,0002,486,272
2Dec 9, 2024 00:0889,899761,650,505548,386,000188,788,0002,347,008
3Dec 9, 2024 00:0895,487813,731,477584,251,000198,745,0002,457,600
4Dec 9, 2024 00:08101,995865,290,914637,509,000198,846,0002,465,792
5Dec 9, 2024 00:08102,599864,859,381645,471,000195,839,0002,297,856
6Dec 9, 2024 00:08115,294967,316,575758,525,000186,883,0002,527,232
7Dec 9, 2024 00:08115,678975,957,743761,644,000186,912,0002,359,296
8Dec 9, 2024 00:08116,248976,384,035760,389,000192,845,0002,453,504
9Dec 9, 2024 00:08118,227992,176,052779,569,000189,895,0002,269,184