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 14, 2026 19:45marko1597marko1597Score: 3,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:163,75639,258,34629,770,0001,037,0002,121,728stderr
2Aug 14, 2026 20:163,75939,066,18929,798,0001,030,0002,121,728stderr
3Aug 14, 2026 20:163,77039,119,81029,881,0001,038,0002,121,728stderr
4Aug 14, 2026 20:163,85739,803,51930,604,0001,027,0002,121,728stderr
5Aug 14, 2026 20:163,88940,090,61430,858,0001,038,0002,121,728stderr
6Aug 14, 2026 20:163,89740,218,06830,939,0001,023,0002,121,728stderr
7Aug 14, 2026 20:163,90241,588,26630,965,0001,036,0002,121,728stderr
8Aug 14, 2026 20:163,92540,548,43431,139,0001,050,0002,121,728stderr
9Aug 14, 2026 20:169,69187,665,05376,432,0003,040,0002,121,728stderr