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 listMay 9, 2026 23:50Andrii StolitniiAndrii StolitniiScore: 85,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 23:5185,380725,855,784650,409,00058,248,0002,359,296
2May 9, 2026 23:5185,547726,158,164650,146,00059,895,0002,351,104
3May 9, 2026 23:5185,589728,760,356650,342,00060,052,0002,363,392
4May 9, 2026 23:5185,596724,436,192650,519,00059,928,0002,359,296
5May 9, 2026 23:5185,615728,699,314649,319,00061,286,0002,367,488
6May 9, 2026 23:5185,635726,205,259650,653,00060,125,0002,351,104
7May 9, 2026 23:5185,637727,727,825650,133,00060,658,0002,351,104
8May 9, 2026 23:5185,640727,330,476650,247,00060,569,0002,363,392
9May 9, 2026 23:5185,756728,000,856651,591,00060,191,0002,363,392