Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMay 10, 2026 13:27wnwnScore: 4,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:284,28445,778,09335,559,00002,113,536
2May 10, 2026 13:284,28943,158,13835,604,00002,113,536
3May 10, 2026 13:284,29345,087,72635,637,00002,113,536
4May 10, 2026 13:284,31845,376,94135,843,00002,113,536
5May 10, 2026 13:284,35144,010,31436,121,00002,113,536
6May 10, 2026 13:284,44346,740,44036,879,00002,113,536
7May 10, 2026 13:284,45246,350,44235,911,0001,044,0002,113,536
8May 10, 2026 13:284,45645,300,45236,991,00002,113,536
9May 10, 2026 13:284,45844,214,22937,003,00002,113,536