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 19:02Danylo MocherniukDanylo MocherniukScore: 10,504Success
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 19:0210,420111,516,58185,479,0001,005,0002,293,760
2Mar 29, 2026 19:0210,423115,262,01185,502,0001,005,0002,510,848
3Mar 29, 2026 19:0210,461113,330,23584,828,0001,995,0002,498,560
4Mar 29, 2026 19:0210,474109,602,79584,934,0001,998,0002,293,760
5Mar 29, 2026 19:0210,504109,782,16485,183,0002,004,0002,293,760
6Mar 29, 2026 19:0210,517113,962,47585,282,0002,006,0002,293,760
7Mar 29, 2026 19:0210,527111,169,77986,370,0001,004,0002,293,760
8Mar 29, 2026 19:0210,528108,595,39486,378,0001,004,0002,293,760
9Mar 29, 2026 19:0210,581113,836,92484,830,0002,994,0002,293,760