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 21, 2026 23:31M-RochatM-RochatScore: 7,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 23:327,62372,034,48758,416,0004,096,0002,113,536
2May 21, 2026 23:327,63771,994,69058,608,0004,016,0002,113,536
3May 21, 2026 23:327,64172,911,63858,568,0004,095,0002,113,536
4May 21, 2026 23:327,71572,631,11359,226,0004,045,0002,113,536
5May 21, 2026 23:327,82774,445,97660,168,0004,015,0002,113,536
6May 21, 2026 23:3219,735171,324,139157,812,0004,023,0002,117,632
7May 21, 2026 23:3219,759171,481,967158,001,0004,025,0002,117,632
8May 21, 2026 23:3219,774171,950,844158,130,0004,024,0002,117,632
9May 21, 2026 23:3219,789174,797,711158,250,0004,027,0002,117,632