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 listFeb 28, 2026 15:03NoSIMD_C#NoSIMD_C#Score: 120,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 15:0392,677790,774,180570,214,000189,738,0002,281,472
2Feb 28, 2026 15:03105,336889,640,425677,022,000186,730,0002,437,120
3Feb 28, 2026 15:03105,802896,659,752675,670,000191,906,0002,531,328
4Feb 28, 2026 15:03118,963996,620,982788,591,000186,903,0002,441,216
5Feb 28, 2026 15:03120,7131,013,616,923782,088,000207,757,0002,433,024
6Feb 28, 2026 15:03131,7471,109,416,681887,443,000192,879,0002,449,408
7Feb 28, 2026 15:03132,3741,112,969,234892,563,000192,905,0002,269,184
8Feb 28, 2026 15:03139,8071,179,733,317937,703,000208,711,0002,514,944
9Feb 28, 2026 15:03166,3941,389,307,6641,171,654,000192,778,0002,449,408