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 listJul 7, 2021 22:15Yuriy LyfenkoYuriy LyfenkoScore: 2,748,676Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2021 22:15212,350581,206,42778,569,684060,993,536
2Jul 7, 2021 22:15213,677606,675,56379,060,467059,260,928
3Jul 7, 2021 22:15230,014701,258,56585,105,294063,000,576
4Jul 7, 2021 22:152,748,6761,077,351,3671,017,010,23402,248,704
5Jul 7, 2021 22:1511,742,9284,407,025,9354,344,883,49002,211,840
6Jul 7, 2021 22:1522,590,8338,441,680,6708,358,608,33502,260,992