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 listJun 29, 2026 13:44IlyaIlyaScore: 61,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 13:4560,82731,976,08621,408,0001,098,0002,113,536
2Jun 29, 2026 13:4560,98632,526,13121,360,0001,205,0002,113,536
3Jun 29, 2026 13:4561,01632,038,93321,341,0001,235,0002,113,536
4Jun 29, 2026 13:4561,06232,475,04921,410,0001,183,0002,113,536
5Jun 29, 2026 13:4561,14032,534,23221,418,0001,204,0002,113,536
6Jun 29, 2026 13:4561,18332,255,25921,400,0001,238,0002,113,536
7Jun 29, 2026 13:4561,36732,638,54321,506,0001,200,0002,113,536
8Jun 29, 2026 13:4561,37032,620,83221,498,0001,209,0002,113,536
9Jun 29, 2026 13:4561,39432,661,20921,496,0001,220,0002,113,536