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 24, 2026 13:28Dominique GarmierDominique GarmierScore: 18,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 13:2818,577178,977,60257,123,00095,205,0002,306,048
2Mar 24, 2026 13:2818,630175,610,96960,907,00091,859,0002,482,176
3Mar 24, 2026 13:2818,630173,488,09058,911,00093,859,0002,338,816