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:14wnwnError
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:140271,309,959260,556,0002,006,0002,113,536expected "53688927887850422 ", got "18446744073709551013 53688927887850422 524129350 0 26658 26368 160 119 104188 668859 30386 29201 1080 94 3755083 450246 29796 28613 1082 90 3751408 450815 "
2Sep 24, 2026 10:140272,208,105261,398,0002,009,0002,113,536expected "53685585902238206 ", got "18446744073709551013 53685585902238206 524128544 0 27324 27027 169 117 98628 674997 30193 29021 1073 88 3755768 448821 29760 28586 1075 88 3753924 448491 "
3Sep 24, 2026 10:140272,641,163261,297,0002,007,0002,113,536expected "53685177486417512 ", got "18446744073709551013 53685177486417512 524131253 0 26612 26314 169 118 99706 670142 30405 29234 1072 87 3759029 448400 29824 28640 1084 90 3759448 448218 "