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 listAug 27, 2026 11:48C#_userC#_userScore: 1,754,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 11:521,733,7351,278,742,505325,207,000316,275,0003,072,000
2Aug 27, 2026 11:521,747,2241,246,956,649327,837,000318,636,0003,072,000
3Aug 27, 2026 11:521,750,2671,238,208,772330,316,000317,283,0003,072,000
4Aug 27, 2026 11:521,750,5081,283,502,209329,234,000318,454,0003,072,000
5Aug 27, 2026 11:521,754,8431,291,634,996333,062,000316,230,0003,072,000
6Aug 27, 2026 11:521,754,9181,253,379,765335,175,000314,145,0003,072,000
7Aug 27, 2026 11:521,761,0321,258,292,788334,438,000317,144,0003,051,520
8Aug 27, 2026 11:521,771,4751,122,083,650336,963,000318,483,0003,072,000
9Aug 27, 2026 11:521,776,3051,263,717,309335,219,000322,014,0003,072,000