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 20, 2026 19:16M-RochatM-RochatScore: 9,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 19:199,11287,754,20770,536,0004,186,0002,113,536
2May 20, 2026 19:199,57690,256,71774,481,0004,043,0002,113,536
3May 20, 2026 19:199,68588,800,25375,395,0004,030,0002,113,536
4May 20, 2026 19:199,83690,847,70876,567,0004,093,0002,113,536
5May 20, 2026 19:199,87592,074,27976,885,0004,094,0002,113,536
6May 20, 2026 19:1921,406184,907,049171,515,0004,021,0002,117,632
7May 20, 2026 19:1921,411197,773,841171,553,0004,023,0002,113,536
8May 20, 2026 19:1922,071191,029,306175,957,0005,027,0002,117,632
9May 20, 2026 19:1922,119192,149,854177,359,0004,024,0002,117,632