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 listApr 14, 2026 03:49Yuriy LyfenkoYuriy LyfenkoScore: 4,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 03:493,90555,141,84630,021,0002,001,0002,404,352
2Apr 14, 2026 03:493,94864,616,71532,376,00002,506,752
3Apr 14, 2026 03:493,97158,955,02731,542,0001,017,0002,392,064
4Apr 14, 2026 03:493,98560,542,45230,635,0002,042,0002,400,256
5Apr 14, 2026 03:494,00558,174,37926,872,0005,971,0002,330,624
6Apr 14, 2026 03:494,01764,575,83131,939,000998,0002,420,736
7Apr 14, 2026 03:494,01956,480,01631,954,000998,0002,342,912
8Apr 14, 2026 03:494,02662,235,68731,014,0002,000,0002,392,064
9Apr 14, 2026 03:494,03459,375,88331,073,0002,004,0002,334,720