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 listAug 29, 2026 16:31Josu San MartinJosu San MartinScore: 5,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 16:335,28352,266,35042,742,0001,115,0002,113,536
2Aug 29, 2026 16:335,29252,414,40142,795,0001,130,0002,113,536
3Aug 29, 2026 16:335,29553,140,90842,828,0001,128,0002,113,536
4Aug 29, 2026 16:335,32652,753,46343,081,0001,130,0002,113,536
5Aug 29, 2026 16:335,33352,675,23143,120,0001,146,0002,113,536
6Aug 29, 2026 16:335,33852,714,53843,182,0001,127,0002,113,536
7Aug 29, 2026 16:335,35152,901,33743,295,0001,121,0002,113,536
8Aug 29, 2026 16:335,36152,947,34243,387,0001,116,0002,113,536
9Aug 29, 2026 16:335,46053,713,69344,182,0001,142,0002,113,536