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 listSep 24, 2026 10:28wnwnError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 10:280385,956,645374,038,0003,089,0002,113,536expected "53691506367418549 ", got "18446744073709551015 53691506367418549 524130021 0 26674 26380 161 123 105231 667539 27431 27028 158 228 106442 1205651 10003 10282 10289 10010 "
2Sep 24, 2026 10:280386,164,553374,381,0003,192,0002,113,536expected "53686817542553975 ", got "18446744073709551015 53686817542553975 524126694 0 26615 26316 173 115 110269 664787 27533 27136 158 221 95605 1206739 10012 10362 10336 10005 "
3Sep 24, 2026 10:280387,133,365374,565,0003,130,0002,113,536expected "53691329984649222 ", got "18446744073709551015 53691329984649222 524137462 0 26586 26295 157 123 101797 662572 27547 27146 158 226 100094 1202495 9997 10331 10369 10007 "