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 13, 2026 04:32olliecrowolliecrowScore: 60,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 03:4860,37850,885,90121,325,0001,015,0002,392,064
2Mar 12, 2026 03:4860,38650,956,71522,343,00002,404,352
3Mar 12, 2026 03:4860,41149,918,99320,320,0002,032,0002,404,352
4Mar 12, 2026 03:4860,49247,719,96321,365,0001,017,0002,273,280
5Mar 13, 2026 04:3260,54348,709,73720,365,0002,036,0002,392,064
6Mar 12, 2026 03:4860,55446,532,72221,387,0001,018,0002,400,256
7Mar 12, 2026 03:4860,55442,488,81222,405,00002,396,160
8Mar 12, 2026 03:4860,61646,953,48022,428,00002,273,280
9Mar 12, 2026 03:4860,66547,185,55921,426,0001,020,0002,273,280
10Mar 13, 2026 04:3260,78643,984,86122,491,00002,273,280
11Mar 12, 2026 03:4860,89247,447,12821,506,0001,024,0002,404,352
12Mar 13, 2026 04:3267,93845,196,36923,126,0002,011,0002,273,280