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 listMar 28, 2026 11:16Dominique GarmierDominique GarmierScore: 13,955Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 11:164,81167,992,21938,437,0001,011,0002,301,952
2Mar 28, 2026 11:164,86070,605,96637,857,0001,992,0002,502,656
3Mar 28, 2026 11:164,87063,047,52236,938,0002,995,0002,375,680
4Mar 28, 2026 11:1613,922143,944,786112,159,0002,002,0002,445,312
5Mar 28, 2026 11:1613,955150,462,053112,426,0002,007,0002,473,984
6Mar 28, 2026 11:1613,970143,743,171112,541,0002,009,0002,301,952
7Mar 28, 2026 11:1613,974141,558,212112,591,0001,992,0002,494,464
8Mar 28, 2026 11:1613,980145,981,360112,646,0001,993,0002,330,624
9Mar 28, 2026 11:1613,991138,481,302110,736,0003,990,0002,408,448