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 13, 2026 17:26Victor MerckléVictor MerckléScore: 187,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 17:27186,8941,561,287,4751,550,169,0001,059,0002,117,632stderr
2May 13, 2026 17:27186,9491,559,043,8841,550,583,0001,097,0002,117,632stderr
3May 13, 2026 17:27186,9931,561,505,1781,550,921,0001,122,0002,117,632stderr
4May 13, 2026 17:27187,1871,562,771,4901,552,614,0001,044,0002,117,632stderr
5May 13, 2026 17:27187,3101,563,481,6681,553,566,0001,113,0002,117,632stderr
6May 13, 2026 17:27188,7921,576,209,4381,565,943,0001,035,0002,117,632stderr
7May 13, 2026 17:27188,8201,575,628,7011,566,137,0001,070,0002,117,632stderr
8May 13, 2026 17:27188,8521,575,848,4611,566,457,0001,022,0002,117,632stderr
9May 13, 2026 17:27188,9201,577,120,8001,566,889,0001,147,0002,117,632stderr