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 4, 2026 16:04olliecrowolliecrowScore: 12,159Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 16:0412,143129,021,76798,565,0001,005,0002,416,640
2Mar 4, 2026 16:0412,159124,349,10997,712,0001,994,0002,424,832
3Mar 4, 2026 16:0412,185128,497,84397,918,0001,998,0002,437,120