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:57Danylo MocherniukDanylo MocherniukScore: 8,192Success
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:578,17387,506,26465,845,0001,995,0002,506,752
2Mar 29, 2026 19:578,17598,133,56566,853,000997,0002,293,760
3Mar 29, 2026 19:578,18591,995,70765,941,0001,998,0002,502,656
4Mar 29, 2026 19:578,18690,473,55266,946,000999,0002,289,664
5Mar 29, 2026 19:578,19289,705,86265,994,0001,999,0002,293,760
6Mar 29, 2026 19:578,19690,144,72666,027,0002,000,0002,293,760
7Mar 29, 2026 19:578,19692,282,64866,027,0002,000,0002,510,848
8Mar 29, 2026 19:578,20191,390,29966,064,0002,001,0002,506,752
9Mar 29, 2026 19:578,20287,878,31666,074,0002,002,0002,293,760