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 16, 2026 20:58janwwwjanwwwScore: 3,117Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 20:593,09735,952,10823,307,0002,089,0002,117,632
2Oct 16, 2026 20:593,10936,057,95323,421,0002,078,0002,117,632
3Oct 16, 2026 20:593,11436,123,25623,385,0002,157,0002,117,632
4Oct 16, 2026 20:593,11436,112,65123,435,0002,106,0002,117,632
5Oct 16, 2026 20:593,11736,098,30023,494,0002,069,0002,117,632
6Oct 16, 2026 20:593,11936,124,03323,518,0002,062,0002,117,632
7Oct 16, 2026 20:593,12237,751,81824,543,0001,063,0002,117,632
8Oct 16, 2026 20:593,12536,174,51723,549,0002,083,0002,117,632
9Oct 16, 2026 20:593,15036,396,98123,693,0002,145,0002,117,632