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 listMay 22, 2026 00:02M-RochatM-RochatScore: 19,356Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 00:0319,226169,872,129153,435,0004,221,0002,117,632
2May 22, 2026 00:0319,230167,651,088153,286,0004,407,0002,117,632
3May 22, 2026 00:0319,311167,881,528153,979,0004,374,0002,117,632
4May 22, 2026 00:0319,346167,992,801154,347,0004,297,0002,117,632
5May 22, 2026 00:0319,356168,107,388154,310,0004,415,0002,117,632
6May 22, 2026 00:0319,415169,367,625154,700,0004,509,0002,113,536
7May 22, 2026 00:0319,418168,877,122154,991,0004,244,0002,117,632
8May 22, 2026 00:0319,425171,072,334154,805,0004,488,0002,117,632
9May 22, 2026 00:0319,601172,973,236156,406,0004,327,0002,117,632