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 11, 2026 15:52wnwnScore: 3,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 15:543,27034,401,55427,149,00002,113,536
2May 11, 2026 15:543,27835,811,44927,208,00002,113,536
3May 11, 2026 15:543,28334,397,85526,238,0001,015,0002,113,536
4May 11, 2026 15:543,29334,550,95327,337,00002,113,536
5May 11, 2026 15:543,29434,853,35826,313,0001,035,0002,113,536
6May 11, 2026 15:543,29537,365,22126,329,0001,023,0002,113,536
7May 11, 2026 15:543,29935,733,09227,382,00002,113,536
8May 11, 2026 15:543,31137,098,79027,488,00002,113,536
9May 11, 2026 15:543,31436,783,87426,501,0001,010,0002,113,536