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 listSep 16, 2024 22:01CheranMahalingamCheranMahalingamScore: 21,564,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 16, 2024 22:0121,449,0167,966,018,8467,735,310,000200,826,0002,281,472
2Sep 16, 2024 22:0121,536,4228,002,818,1927,762,619,000205,857,0002,281,472
3Sep 16, 2024 22:0121,559,9978,006,572,0637,768,351,000208,848,0002,289,664
4Sep 16, 2024 22:0121,562,7148,014,395,6647,767,384,000210,820,0002,281,472
5Sep 16, 2024 22:0121,564,2928,016,858,9627,763,956,000214,832,0002,306,048
6Sep 16, 2024 22:0121,581,0418,021,893,7517,777,142,000207,843,0002,281,472
7Sep 16, 2024 22:0121,649,6768,043,664,8547,813,519,000196,861,0002,281,472
8Sep 16, 2024 22:0121,652,5228,043,644,6867,799,581,000211,852,0002,281,472
9Sep 16, 2024 22:0121,685,4168,061,112,3247,812,773,000210,831,0002,297,856