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 21, 2026 22:27Dominique GarmierDominique GarmierScore: 10,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 22:2710,487117,799,13683,995,0001,999,0002,310,144
2Mar 21, 2026 22:2710,493112,357,78883,045,0003,001,0002,510,848
3Mar 21, 2026 22:2710,494109,017,22784,048,0002,001,0002,355,200
4Mar 21, 2026 22:2710,511113,259,40785,188,0001,002,0002,285,568
5Mar 21, 2026 22:2710,525120,439,14883,298,0003,010,0002,281,472
6Mar 21, 2026 22:2710,596116,933,39484,891,0001,997,0002,461,696
7Mar 21, 2026 22:2710,611110,800,22986,007,0001,000,0002,281,472
8Mar 21, 2026 22:2710,620119,135,90686,069,0001,012,0002,437,120
9Mar 21, 2026 22:2710,688111,978,65285,626,0002,014,0002,273,280