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 4, 2026 06:10olliecrowolliecrowScore: 12,144Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 06:1012,131121,235,24298,473,0001,004,0002,416,640
2Mar 4, 2026 06:1012,136124,376,85498,508,0001,005,0002,404,352
3Mar 4, 2026 06:1012,142124,625,06898,558,0001,005,0002,449,408
4Mar 4, 2026 06:1012,142125,821,52999,565,00002,412,544
5Mar 4, 2026 06:1012,144133,934,36099,577,00002,408,448
6Mar 4, 2026 06:1012,149126,878,67495,640,0003,985,0002,428,928
7Mar 4, 2026 06:1012,161129,193,72898,723,000997,0002,420,736
8Mar 4, 2026 06:1012,163123,488,85398,737,000997,0002,428,928
9Mar 4, 2026 06:1012,163128,067,62297,741,0001,994,0002,408,448