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 listJan 13, 2026 02:58Josu San MartinJosu San MartinScore: 68,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 02:5868,64148,707,85825,397,00002,404,352
2Jan 13, 2026 02:5868,68450,998,78024,397,0001,016,0002,277,376
3Jan 13, 2026 02:5868,69750,680,26724,402,0001,016,0002,277,376
4Jan 13, 2026 02:5868,77648,171,08224,430,0001,017,0002,400,256
5Jan 13, 2026 02:5868,88644,762,82125,488,00002,392,064
6Jan 13, 2026 02:5868,97652,169,19424,501,0001,020,0002,277,376
7Jan 13, 2026 02:5869,05448,728,54124,528,0001,022,0002,392,064
8Jan 13, 2026 02:5869,06552,045,28824,532,0001,022,0002,277,376
9Jan 13, 2026 02:5869,16247,410,68324,567,0001,023,0002,277,376