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 08:11marko1597marko1597Score: 7,347Success
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 08:472,82831,557,12522,023,0001,167,0002,117,632stderr
2Aug 16, 2026 08:472,83631,606,54422,051,0001,210,0002,117,632stderr
3Aug 16, 2026 08:472,84831,735,71622,179,0001,175,0002,117,632stderr
4Aug 16, 2026 08:472,87831,863,25522,575,0001,032,0002,117,632stderr
5Aug 16, 2026 08:477,34768,549,65859,092,0001,157,0002,117,632stderr
6Aug 16, 2026 08:477,42069,229,14459,684,0001,163,0002,117,632stderr
7Aug 16, 2026 08:477,45469,447,42960,000,0001,124,0002,117,632stderr
8Aug 16, 2026 08:477,52370,232,73760,572,0001,124,0002,117,632stderr
9Aug 16, 2026 08:477,57270,457,83260,956,0001,135,0002,117,632stderr