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 24, 2026 09:32olliecrowolliecrowScore: 23,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 09:333,28549,775,50324,944,0001,995,0002,351,104stderr
2Apr 24, 2026 09:333,30046,384,89525,061,0002,004,0002,355,200stderr
3Apr 24, 2026 09:333,31747,148,22224,178,0003,022,0002,547,712stderr
4Apr 24, 2026 09:333,32052,387,47024,203,0003,025,0002,527,232stderr
5Apr 24, 2026 09:3323,762212,918,616191,852,0002,997,0002,400,256stderr
6Apr 24, 2026 09:3323,771209,798,130192,931,0001,999,0002,506,752stderr
7Apr 24, 2026 09:3323,784210,613,067192,033,0003,000,0002,527,232stderr
8Apr 24, 2026 09:3323,815209,966,942193,286,0002,002,0002,318,336stderr
9Apr 24, 2026 09:3323,894215,750,690192,939,0002,999,0002,445,312stderr