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 8, 2026 20:43Victor MerckléVictor MerckléScore: 3,679Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 20:453,58738,365,69128,736,0001,038,0002,146,304stderr
2Sep 8, 2026 20:453,59538,453,88628,799,0001,047,0002,142,208stderr
3Sep 8, 2026 20:453,60646,942,96228,857,0001,073,0002,146,304stderr
4Sep 8, 2026 20:453,61245,338,81228,950,0001,036,0002,142,208stderr
5Sep 8, 2026 20:453,67939,120,18129,502,0001,037,0002,142,208stderr
6Sep 8, 2026 20:453,68339,146,80629,537,0001,035,0002,142,208stderr
7Sep 8, 2026 20:453,70840,161,06129,744,0001,035,0002,142,208stderr
8Sep 8, 2026 20:453,73647,490,59729,978,0001,034,0002,142,208stderr
9Sep 8, 2026 20:453,87249,773,86431,074,0001,071,0002,142,208stderr