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 listAug 15, 2026 23:43marko1597marko1597Score: 73,757Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 23:5672,824606,937,613594,664,0002,494,0002,117,632stderr
2Aug 15, 2026 23:5673,355611,434,645599,072,0002,445,0002,117,632stderr
3Aug 15, 2026 23:5673,409611,827,152599,621,0002,339,0002,117,632stderr
4Aug 15, 2026 23:5673,624613,706,338601,689,0002,034,0002,117,632stderr
5Aug 15, 2026 23:5673,757614,807,871602,362,0002,450,0002,117,632stderr
6Aug 15, 2026 23:5674,105617,661,603605,142,0002,521,0002,117,632stderr
7Aug 15, 2026 23:5674,243618,599,391606,357,0002,436,0002,117,632stderr
8Aug 15, 2026 23:5674,748632,398,371610,355,0002,585,0002,117,632stderr
9Aug 15, 2026 23:5674,855623,747,963611,270,0002,548,0002,117,632stderr