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 listOct 5, 2026 02:10FrederickFrederickScore: 8,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:118,57981,670,11869,183,0002,030,0002,117,632
2Oct 5, 2026 02:118,62683,365,79669,596,0002,008,0002,117,632
3Oct 5, 2026 02:118,64482,872,22169,699,0002,054,0002,117,632
4Oct 5, 2026 02:118,71283,090,62870,239,0002,076,0002,117,632
5Oct 5, 2026 02:118,77283,952,46770,767,0002,042,0002,117,632
6Oct 5, 2026 02:118,82083,655,06671,183,0002,031,0002,117,632
7Oct 5, 2026 02:118,85183,919,55771,460,0002,011,0002,117,632
8Oct 5, 2026 02:118,97585,668,55072,450,0002,045,0002,117,632
9Oct 5, 2026 02:118,99185,230,00772,597,0002,034,0002,117,632