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 listMar 19, 2026 23:08olliecrowolliecrowScore: 17,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 23:0817,704170,768,266143,172,0002,002,0002,486,272
2Mar 19, 2026 23:0817,741174,009,136141,492,0003,985,0002,490,368
3Mar 19, 2026 23:0817,774170,063,522143,749,0001,996,0002,408,448