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 18, 2026 16:15M-RochatM-RochatScore: 25,207Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 16:1824,939214,229,766191,323,00013,178,0002,117,632
2May 18, 2026 16:1825,038214,731,503192,762,00012,551,0002,117,632
3May 18, 2026 16:1825,072215,010,230193,144,00012,451,0002,117,632
4May 18, 2026 16:1825,146217,462,363193,259,00012,941,0002,117,632
5May 18, 2026 16:1825,207218,648,763193,534,00013,168,0002,117,632
6May 18, 2026 16:1825,228217,230,001194,355,00012,520,0002,117,632
7May 18, 2026 16:1825,236218,972,982194,339,00012,603,0002,117,632
8May 18, 2026 16:1825,432221,463,527195,426,00013,122,0002,117,632
9May 18, 2026 16:1825,540219,338,725196,593,00012,836,0002,117,632