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 13:51Danylo MocherniukDanylo MocherniukScore: 13,011Success
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 13:5112,891129,833,109104,998,0001,999,0002,506,752
2Mar 29, 2026 13:5112,912136,413,689105,166,0002,003,0002,502,656
3Mar 29, 2026 13:5112,913131,575,116105,176,0002,003,0002,293,760
4Mar 29, 2026 13:5112,992130,899,096106,839,000998,0002,293,760
5Mar 29, 2026 13:5113,011129,037,823105,990,0001,999,0002,293,760
6Mar 29, 2026 13:5113,028130,504,435107,131,0001,001,0002,293,760
7Mar 29, 2026 13:5113,200140,890,000108,558,0001,005,0002,502,656
8Mar 29, 2026 13:5113,223138,912,251107,756,0001,995,0002,293,760
9Mar 29, 2026 13:5113,260133,801,578108,060,0002,001,0002,293,760