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 16, 2026 07:11marko1597marko1597Score: 2,936Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 07:252,91632,321,55022,621,0001,296,0002,117,632stderr
2Aug 16, 2026 07:252,91932,377,15722,640,0001,297,0002,117,632stderr
3Aug 16, 2026 07:252,92332,424,75622,686,0001,284,0002,117,632stderr
4Aug 16, 2026 07:252,92533,042,98822,693,0001,298,0002,117,632stderr
5Aug 16, 2026 07:252,93632,479,27323,037,0001,040,0002,117,632stderr
6Aug 16, 2026 07:252,94333,263,39123,087,0001,047,0002,117,632stderr
7Aug 16, 2026 07:252,97441,150,63423,355,0001,032,0002,117,632stderr
8Aug 16, 2026 07:257,01465,935,75856,314,0001,207,0002,117,632stderr
9Aug 16, 2026 07:257,02966,068,97856,452,0001,187,0002,117,632stderr