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 4, 2025 13:13NoSIMD_C#NoSIMD_C#Score: 598,913Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 4, 2025 13:13555,1134,578,203,6224,412,023,000139,905,0002,387,968
2Apr 4, 2025 13:13558,8104,607,613,4344,437,329,000144,912,0002,445,312
3Apr 4, 2025 13:13561,9994,638,691,2154,485,465,000122,930,0002,433,024
4Apr 4, 2025 13:13582,8994,815,787,1034,655,832,000123,942,0002,277,376
5Apr 4, 2025 13:13598,9134,937,069,4554,791,155,000119,928,0002,338,816
6Apr 4, 2025 13:13603,5694,978,541,8174,823,337,000125,930,0002,514,944
7Apr 4, 2025 13:13642,9705,307,578,6845,147,442,000124,913,0002,428,928
8Apr 4, 2025 13:13670,8985,526,626,9925,381,444,000119,920,0002,441,216
9Apr 4, 2025 13:13786,8506,483,615,6726,308,258,000143,914,0002,367,488