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 listAug 15, 2026 21:59marko1597marko1597Score: 3,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:113,08033,719,23224,076,0001,187,0002,121,728stderr
2Aug 15, 2026 22:113,09033,787,00924,156,0001,189,0002,121,728stderr
3Aug 15, 2026 22:113,09133,768,86324,167,0001,185,0002,121,728stderr
4Aug 15, 2026 22:113,09335,126,26124,168,0001,198,0002,121,728stderr
5Aug 15, 2026 22:113,10033,895,75124,283,0001,144,0002,121,728stderr
6Aug 15, 2026 22:113,10933,946,20124,451,0001,045,0002,121,728stderr
7Aug 15, 2026 22:113,11934,603,54124,543,0001,040,0002,121,728stderr
8Aug 15, 2026 22:113,12234,046,69924,549,0001,053,0002,121,728stderr
9Aug 15, 2026 22:113,12734,040,27924,603,0001,044,0002,121,728stderr