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 21, 2026 03:03Dominique GarmierDominique GarmierScore: 512,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 20, 2026 02:49511,992215,337,062188,435,0001,002,0002,457,600
2Mar 21, 2026 03:03512,057214,147,394186,470,0002,991,0002,506,752
3Mar 28, 2026 23:56512,119219,828,527187,490,0001,994,0002,465,792
4Mar 28, 2026 23:56512,346217,130,330187,573,0001,995,0002,510,848
5Mar 20, 2026 02:49512,576216,838,060187,657,0001,996,0002,457,600
6Mar 21, 2026 03:03513,168214,334,902187,874,0001,998,0002,506,752
7Mar 20, 2026 02:49513,957216,686,703188,163,0002,001,0002,457,600
8Mar 21, 2026 03:03514,054212,799,534188,198,0002,002,0002,457,600
9Mar 28, 2026 23:56514,716217,731,718188,451,0001,994,0002,510,848