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 22:41marko1597marko1597Score: 3,095Success
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:133,05734,649,48123,957,0001,118,0002,117,632stderr
2Aug 15, 2026 23:133,07333,373,48724,076,0001,124,0002,117,632stderr
3Aug 15, 2026 23:133,07733,693,83424,071,0001,165,0002,117,632stderr
4Aug 15, 2026 23:133,08033,691,12924,140,0001,124,0002,117,632stderr
5Aug 15, 2026 23:133,09533,793,44224,235,0001,149,0002,117,632stderr
6Aug 15, 2026 23:133,09633,818,62524,233,0001,160,0002,117,632stderr
7Aug 15, 2026 23:133,10135,172,01024,263,0001,167,0002,117,632stderr
8Aug 15, 2026 23:133,10834,565,84324,329,0001,157,0002,117,632stderr
9Aug 15, 2026 23:133,11533,979,22824,378,0001,173,0002,117,632stderr