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 3, 2026 23:16Josu San MartinJosu San MartinScore: 3,071Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 23:163,04835,005,80523,958,0001,040,0002,121,728stderr
2Sep 3, 2026 23:163,05035,049,13623,985,0001,028,0002,121,728stderr
3Sep 3, 2026 23:163,05835,002,25724,051,0001,029,0002,121,728stderr
4Sep 3, 2026 23:163,06336,590,25624,092,0001,030,0002,121,728stderr
5Sep 3, 2026 23:163,07135,170,13224,156,0001,033,0002,121,728stderr
6Sep 3, 2026 23:163,08235,258,64224,245,0001,030,0002,121,728stderr
7Sep 3, 2026 23:1615,205134,663,764123,653,0001,031,0002,121,728stderr
8Sep 3, 2026 23:1615,216135,762,384123,756,0001,016,0002,121,728stderr
9Sep 3, 2026 23:1615,218134,619,081123,678,0001,115,0002,121,728stderr