TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listMar 17, 2025 22:26Aniruddha DebAniruddha DebScore: 69,365Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2025 22:2668,88647,895,74625,488,00002,269,184
2Mar 17, 2025 22:2569,09550,318,97624,543,0001,022,0002,412,544
3Mar 17, 2025 22:2569,14653,282,94625,584,00002,531,328
4Mar 17, 2025 22:2569,16248,488,60525,590,00002,433,024
5Mar 17, 2025 22:2569,16848,174,76625,592,00002,416,640
6Mar 17, 2025 22:2569,19750,287,57825,603,00002,424,832
7Mar 17, 2025 22:2569,36549,594,60924,639,0001,026,0002,424,832
8Mar 17, 2025 22:2669,40056,231,53924,651,0001,027,0002,531,328
9Mar 17, 2025 22:2669,86554,526,94224,856,000994,0002,531,328
10Mar 17, 2025 22:2569,88651,638,94625,858,00002,531,328
11Mar 17, 2025 22:2569,89548,858,18224,867,000994,0002,531,328
12Mar 17, 2025 22:2569,89749,513,55724,868,000994,0002,510,848