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 05:21Josu San MartinJosu San MartinScore: 20,886Success
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 05:2210,43095,687,53980,402,0005,128,0002,113,536
2Sep 3, 2026 05:2211,056100,741,20584,538,0006,127,0002,113,536
3Sep 3, 2026 05:2211,275103,278,97786,403,0006,057,0002,113,536
4Sep 3, 2026 05:2219,698172,431,347155,171,0006,360,0002,117,632
5Sep 3, 2026 05:2220,886182,079,283165,108,0006,163,0002,117,632
6Sep 3, 2026 05:2220,896181,712,997165,207,0006,145,0002,117,632
7Sep 3, 2026 05:2221,086183,707,207166,350,0006,558,0002,117,632
8Sep 3, 2026 05:2221,553186,733,661170,412,0006,323,0002,117,632
9Sep 3, 2026 05:2221,805189,628,082172,040,0006,768,0002,117,632