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 listApr 19, 2025 16:02Aleksey ShvetsAleksey ShvetsScore: 287,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 16:02287,7772,415,103,6122,297,605,00090,944,0002,334,720
2Apr 19, 2025 16:02287,8872,418,934,2592,293,525,00095,938,0002,334,720
3Apr 19, 2025 16:02287,9162,420,677,9612,295,755,00093,949,0002,392,064
4Apr 19, 2025 16:02287,9412,419,587,7762,287,959,000101,953,0002,527,232
5Apr 19, 2025 16:02287,9422,420,244,2012,278,972,000110,949,0002,519,040
6Apr 19, 2025 16:02288,1052,423,318,1982,305,295,00085,973,0002,334,720