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 listOct 18, 2024 16:52Sybrand AarnoutseSybrand AarnoutseScore: 322,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 18, 2024 16:52322,0082,674,055,4742,510,594,000129,875,0002,404,352
2Oct 18, 2024 16:52322,0182,668,677,7332,520,663,000119,888,0002,510,848
3Oct 18, 2024 16:52322,1582,669,135,7092,523,799,000117,897,0002,408,448
4Oct 18, 2024 16:52322,3202,668,316,1752,517,122,000125,906,0002,301,952
5Oct 18, 2024 16:52322,3402,672,770,9882,525,314,000117,874,0002,285,568
6Oct 18, 2024 16:52322,3442,670,970,7852,521,352,000121,872,0002,420,736
7Oct 18, 2024 16:52322,4702,674,267,4282,525,334,000118,921,0002,412,544
8Oct 18, 2024 16:52322,4902,678,137,9182,525,533,000118,883,0002,285,568
9Oct 18, 2024 16:52322,5052,671,821,5472,513,663,000130,878,0002,408,448