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 27, 2024 22:38emily graceemily graceScore: 124,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 22:3890,863822,411,325745,079,49302,174,976
2Mar 27, 2024 22:38124,5851,087,759,0241,021,599,43202,199,552
3Mar 27, 2024 22:38136,1161,176,062,6141,116,151,06202,174,976