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:10Danylo MocherniukDanylo MocherniukScore: 9,960Success
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:109,918110,242,02780,315,0002,007,0002,502,656
2Mar 29, 2026 19:109,946109,397,06582,551,00002,293,760
3Mar 29, 2026 19:109,953111,102,30481,606,0001,007,0002,506,752
4Mar 29, 2026 19:109,959109,806,00681,654,0001,008,0002,293,760
5Mar 29, 2026 19:109,960112,705,39182,669,00002,506,752
6Mar 29, 2026 19:109,973108,422,30881,776,000997,0002,293,760
7Mar 29, 2026 19:109,975107,679,67980,801,0001,995,0002,502,656
8Mar 29, 2026 19:109,981108,208,10980,845,0001,996,0002,293,760
9Mar 29, 2026 19:109,986109,210,44579,891,0002,995,0002,506,752