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 02:47Yuriy LyfenkoYuriy LyfenkoScore: 5,433Success
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 02:475,31772,472,94242,127,0002,006,0002,301,952
2Mar 18, 2026 02:475,34369,498,37042,334,0002,015,0002,285,568
3Mar 18, 2026 02:475,36565,960,20843,521,0001,012,0002,310,144
4Mar 18, 2026 02:475,41270,923,08242,920,0001,996,0002,293,760
5Mar 18, 2026 02:475,43371,544,04642,086,0003,006,0002,306,048
6Mar 18, 2026 02:475,52280,422,99142,846,0002,989,0002,465,792
7Mar 18, 2026 02:475,52373,360,71743,850,0001,993,0002,297,856
8Mar 18, 2026 02:475,53574,527,99843,943,0001,997,0002,285,568
9Mar 18, 2026 02:475,56474,063,04843,169,0003,011,0002,285,568