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 17, 2026 21:05zielajzielajError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 21:06038,421,78327,967,0001,042,0002,113,536expected "53690830404787308 ", got "53690828585848329 "
2May 17, 2026 21:063,30035,792,64026,304,0001,090,0002,113,536
3May 17, 2026 21:063,30335,453,95526,396,0001,020,0002,113,536
4May 17, 2026 21:063,31136,711,04926,457,0001,030,0002,113,536
5May 17, 2026 21:063,32537,142,76026,570,0001,035,0002,113,536
6May 17, 2026 21:063,46838,617,73027,748,0001,044,0002,113,536
7May 17, 2026 21:063,47238,569,29227,788,0001,030,0002,113,536
8May 17, 2026 21:063,47638,440,28527,833,0001,021,0002,113,536
9May 17, 2026 21:063,51138,615,40428,119,0001,030,0002,113,536