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 listSep 4, 2026 00:16Josu San MartinJosu San MartinScore: 3,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 4, 2026 00:163,04134,890,93323,727,0001,211,0002,121,728stderr
2Sep 4, 2026 00:163,06835,055,07624,111,0001,048,0002,121,728stderr
3Sep 4, 2026 00:163,06935,085,34224,140,0001,026,0002,121,728stderr
4Sep 4, 2026 00:163,07735,323,38224,211,0001,026,0002,121,728stderr
5Sep 4, 2026 00:163,08135,262,68824,237,0001,033,0002,121,728stderr
6Sep 4, 2026 00:163,15636,010,56024,860,0001,021,0002,121,728stderr
7Sep 4, 2026 00:1615,222134,754,086123,814,0001,007,0002,121,728stderr
8Sep 4, 2026 00:1615,260135,914,117124,131,0001,006,0002,121,728stderr
9Sep 4, 2026 00:1615,432136,503,378125,539,0001,007,0002,121,728stderr