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 22:21M-RochatM-RochatScore: 5,579Success
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 22:225,50855,331,53341,982,0003,191,0002,113,536
2May 22, 2026 22:225,52254,947,62641,965,0003,316,0002,113,536
3May 22, 2026 22:225,53457,799,97742,145,0003,237,0002,113,536
4May 22, 2026 22:225,53855,585,87842,093,0003,322,0002,113,536
5May 22, 2026 22:225,57956,058,31642,553,0003,197,0002,113,536
6May 22, 2026 22:225,59357,839,75942,519,0003,351,0002,113,536
7May 22, 2026 22:225,71956,249,34443,534,0003,367,0002,113,536
8May 22, 2026 22:2217,485152,825,237139,184,0004,200,0002,113,536
9May 22, 2026 22:2217,622155,984,922140,238,0004,267,0002,113,536