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 listJul 2, 2026 10:27Evgenii ZheltonozhskiiEvgenii ZheltonozhskiiScore: 316,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 10:28316,4712,605,061,3282,414,934,000180,129,0002,117,632
2Jul 2, 2026 10:28316,7732,607,078,4282,415,376,000182,167,0002,117,632
3Jul 2, 2026 10:28316,8452,607,721,6132,416,575,000181,556,0002,117,632