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 14:30NoSIMD_C#NoSIMD_C#Score: 351,559Success
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 14:30281,7832,334,157,2992,201,686,000108,935,0002,420,736
2Apr 4, 2025 14:30351,5592,914,014,7812,768,834,000113,952,0002,367,488
3Apr 4, 2025 14:30365,9163,024,353,9342,880,575,000119,940,0002,396,160