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 listApr 3, 2023 21:35Yurkov AlekseyYurkov AlekseyScore: 108,859Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:35107,82762,075,04837,902,0001,994,0002,273,280
2Apr 3, 2023 21:35108,05768,695,96937,982,0001,999,0002,273,280
3Apr 3, 2023 21:35108,29261,063,51938,065,0002,003,0002,523,136
4Apr 3, 2023 21:35108,30863,284,86238,071,0002,003,0002,273,280
5Apr 3, 2023 21:35108,43864,730,39139,119,0001,003,0002,281,472
6Apr 3, 2023 21:35108,46266,766,16938,125,0002,006,0002,277,376
7Apr 3, 2023 21:35108,85968,526,09939,272,0001,006,0002,273,280
8Apr 3, 2023 21:35109,01668,530,14336,303,0004,033,0002,273,280
9Apr 3, 2023 21:35109,64366,035,30639,554,0001,014,0002,383,872
10Apr 3, 2023 21:35111,197103,462,71441,142,84202,273,280
11Apr 3, 2023 21:35111,906111,152,35241,405,10402,269,184
12Apr 3, 2023 21:35112,213112,769,00741,518,90402,260,992