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 20:23Danylo MocherniukDanylo MocherniukScore: 7,003Success
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 20:236,97190,450,73655,865,0001,995,0002,510,848
2Mar 29, 2026 20:236,98084,568,87256,937,000998,0002,293,760
3Mar 29, 2026 20:236,99082,179,83056,013,0002,000,0002,502,656
4Mar 29, 2026 20:237,00280,804,37656,116,0002,004,0002,510,848
5Mar 29, 2026 20:237,00380,806,89956,121,0002,004,0002,293,760
6Mar 29, 2026 20:237,00783,418,95856,152,0002,005,0002,293,760
7Mar 29, 2026 20:237,01380,527,98157,205,0001,003,0002,502,656
8Mar 29, 2026 20:237,02785,687,96756,315,0002,011,0002,494,464
9Mar 29, 2026 20:237,03483,517,23058,383,00002,506,752