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 listJan 9, 2026 18:39AVGAVGScore: 43,886Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 18:3943,857389,373,343362,011,0002,000,0002,396,160
2Jan 9, 2026 18:3943,861387,264,055363,045,0001,000,0002,383,872
3Jan 9, 2026 18:3943,872386,908,844362,137,0002,000,0002,392,064
4Jan 9, 2026 18:3943,875392,901,702364,162,00002,396,160
5Jan 9, 2026 18:3943,886384,006,023362,249,0002,001,0002,396,160
6Jan 9, 2026 18:3943,888388,992,810363,270,0001,000,0002,269,184
7Jan 9, 2026 18:3943,890392,254,948363,286,0001,000,0002,408,448
8Jan 9, 2026 18:3943,893386,786,176363,309,0001,000,0002,269,184
9Jan 9, 2026 18:3943,983388,034,203364,063,0001,000,0002,396,160