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 27, 2026 17:08Dominique GarmierDominique GarmierScore: 9,482Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2026 17:089,41699,366,21574,201,0003,008,0002,334,720
2Mar 28, 2026 10:379,449102,101,66076,477,0001,006,0002,318,336
3Mar 28, 2026 10:379,459103,283,95675,552,0002,014,0002,318,336
4Mar 27, 2026 17:089,482108,028,94175,762,0001,993,0002,465,792
5Mar 27, 2026 17:089,484101,392,46874,780,0002,991,0002,437,120
6Mar 28, 2026 10:379,517103,200,68575,035,0003,001,0002,510,848