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 listMar 29, 2026 14:49Danylo MocherniukDanylo MocherniukScore: 11,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 29, 2026 14:4911,572119,144,05494,050,0002,001,0002,293,760
2Mar 29, 2026 14:4911,573120,744,61894,053,0002,001,0002,293,760
3Mar 29, 2026 14:4911,576118,930,70194,080,0002,001,0002,293,760
4Mar 29, 2026 14:4911,578120,777,03294,095,0002,002,0002,506,752
5Mar 29, 2026 14:4911,580118,680,61695,116,0001,001,0002,293,760
6Mar 29, 2026 14:4911,582115,711,35594,130,0002,002,0002,293,760
7Mar 29, 2026 14:4911,582118,523,66895,133,0001,001,0002,494,464
8Mar 29, 2026 14:4911,582118,995,42995,130,0001,001,0002,293,760
9Mar 29, 2026 14:4911,759122,654,51996,597,0001,006,0002,293,760