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 listApr 16, 2026 00:08zielajzielajScore: 5,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2026 00:082,78853,181,78922,864,00002,420,736
2Apr 16, 2026 00:112,78947,050,67621,879,000994,0002,514,944
3Apr 16, 2026 00:112,81145,828,53022,046,0001,002,0002,322,432
4Apr 16, 2026 00:115,29069,360,98542,373,0001,008,0002,400,256
5Apr 16, 2026 00:115,29569,973,08443,421,00002,428,928
6Apr 16, 2026 00:115,30270,808,21841,457,0002,022,0002,514,944
7Apr 16, 2026 00:115,30974,606,72942,524,0001,012,0002,326,528
8Apr 16, 2026 00:115,31467,211,12443,572,00002,445,312
9Apr 16, 2026 00:115,31569,309,52142,574,0001,013,0002,375,680
10Apr 16, 2026 00:085,34075,406,94341,800,0001,990,0002,510,848
11Apr 16, 2026 00:085,34769,421,37039,857,0003,985,0002,392,064
12Apr 16, 2026 00:115,51269,139,96841,182,0004,017,0002,404,352