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, 2025 02:02KeefeKeefeScore: 61,000Success
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, 2025 02:0260,727523,808,209323,973,000173,985,0002,473,984
2Apr 24, 2025 02:0261,000524,615,952320,486,000179,712,0002,473,984
3Apr 24, 2025 02:0261,129527,457,012328,512,000172,743,0002,314,240