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 listDec 21, 2025 10:36Mark R BestMark R BestScore: 85,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 10:3685,323728,150,514479,446,000228,735,0002,424,832
2Dec 21, 2025 10:3685,603736,598,148479,669,000230,840,0002,273,280
3Dec 21, 2025 10:3685,717735,627,236480,627,000230,821,0002,285,568
4Dec 21, 2025 10:3685,845736,886,571479,674,000232,842,0002,285,568
5Dec 21, 2025 10:3685,911740,334,145480,367,000232,693,0002,523,136
6Dec 21, 2025 10:3685,978737,658,280479,743,000233,874,0002,285,568
7Dec 21, 2025 10:3685,980741,084,639479,752,000233,879,0002,523,136
8Dec 21, 2025 10:3686,147740,603,131479,346,000235,678,0002,482,176
9Dec 21, 2025 10:3686,219741,304,349479,744,000235,874,0002,359,296