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 listNov 4, 2025 17:39caandocaandoScore: 6,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2025 17:395,81876,141,66246,279,0002,012,0002,285,568
2Nov 4, 2025 17:395,87974,147,38446,802,0001,991,0002,285,568
3Nov 4, 2025 17:395,91772,468,66348,109,0001,002,0002,285,568
4Nov 4, 2025 17:396,03776,438,05749,104,0001,002,0002,519,040
5Nov 4, 2025 17:396,04673,614,19148,177,0002,007,0002,269,184
6Nov 4, 2025 17:396,05575,146,58348,245,0002,010,0002,260,992