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 20:46wnwnError
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 20:460116,686,646106,875,0001,042,0002,113,536expected "53686204602500143 ", got "18446744073709551055 53686204602500143 25295802818 524128408 0 221 0 7490457 7486603 7493248 6473261 6467178 6477250 6547017 6543687 6549533 6468618 6463603 6472622 "
2Sep 24, 2026 20:460116,408,295106,559,0001,059,0002,113,536expected "53675758250459974 ", got "18446744073709551055 53675758250459974 25295339114 524118539 0 221 0 7193340 7190355 7195690 6512610 6507231 6517119 6593013 6589423 6595758 6507631 6502194 6511059 "
3Sep 24, 2026 20:460117,248,260106,630,0001,128,0002,113,536expected "53681892341755908 ", got "18446744073709551055 53681892341755908 25295644114 524125681 0 221 8 7386300 7392235 7398947 6439673 6434063 6443146 6490329 6487359 6493061 6449533 6444663 6452829 "