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 18, 2026 03:18Yuriy LyfenkoYuriy LyfenkoScore: 5,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 03:184,72564,674,77236,198,0003,016,0002,285,568
2Mar 18, 2026 03:184,72969,586,99536,230,0003,019,0002,285,568
3Mar 18, 2026 03:184,73066,810,69036,242,0003,020,0002,285,568
4Mar 18, 2026 03:184,73367,431,12938,276,0001,007,0002,293,760
5Mar 18, 2026 03:185,03472,509,61940,791,000994,0002,301,952
6Mar 18, 2026 03:185,03871,815,34640,817,000995,0002,301,952
7Mar 18, 2026 03:185,04069,335,85338,843,0002,987,0002,293,760
8Mar 18, 2026 03:185,04267,516,50039,858,0001,992,0002,297,856
9Mar 18, 2026 03:185,04367,592,05339,862,0001,993,0002,293,760