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 25, 2026 04:57limanjun99limanjun99Score: 42,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 04:5840,323349,997,350326,659,0003,995,0002,314,240
2Apr 25, 2026 04:5841,486358,388,385335,187,0005,002,0002,330,624
3Apr 25, 2026 04:5841,628356,076,645334,343,0007,007,0002,506,752
4Apr 25, 2026 04:5842,378363,755,095340,491,0007,010,0002,351,104
5Apr 25, 2026 04:5842,606372,482,560344,372,0005,005,0002,473,984
6Apr 25, 2026 04:5842,809376,437,219347,035,0004,000,0002,318,336
7Apr 25, 2026 04:5843,493374,433,712350,649,0005,994,0002,469,888
8Apr 25, 2026 04:5843,865379,425,959352,704,0006,994,0002,543,616
9Apr 25, 2026 04:5844,308378,538,307359,327,0004,003,0002,306,048