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 3, 2026 20:48Victor MerckléVictor MerckléScore: 4,524Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 20:484,51045,986,77736,356,0001,084,0002,113,536
2Sep 3, 2026 20:484,51846,631,21036,423,0001,083,0002,113,536
3Sep 3, 2026 20:484,52245,987,21236,440,0001,093,0002,113,536
4Sep 3, 2026 20:484,52345,991,23036,461,0001,082,0002,113,536
5Sep 3, 2026 20:484,52446,695,38236,427,0001,129,0002,113,536
6Sep 3, 2026 20:484,52445,985,38336,459,0001,094,0002,113,536
7Sep 3, 2026 20:484,52545,982,05036,459,0001,105,0002,113,536
8Sep 3, 2026 20:484,53646,090,67636,606,0001,050,0002,113,536
9Sep 3, 2026 20:484,54847,251,39636,710,0001,045,0002,113,536