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 listMay 17, 2026 02:28M-RochatM-RochatScore: 17,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 02:3012,485111,412,05296,641,0005,743,0002,113,536
2May 17, 2026 02:3012,618112,471,32298,020,0005,454,0002,113,536
3May 17, 2026 02:3012,748113,315,55198,426,0006,110,0002,113,536
4May 17, 2026 02:3017,503152,286,376137,695,0005,832,0002,117,632
5May 17, 2026 02:3017,550152,810,436138,090,0005,827,0002,117,632
6May 17, 2026 02:3017,607157,078,520137,401,0006,982,0002,117,632
7May 17, 2026 02:3017,686156,066,366139,375,0005,657,0002,117,632
8May 17, 2026 02:3017,833155,026,939139,440,0006,793,0002,117,632
9May 17, 2026 02:3017,843156,497,772139,706,0006,607,0002,117,632