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 listSep 3, 2026 21:29boop34boop34Score: 12,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 21:3012,252111,588,535100,682,0001,013,0002,113,536
2Sep 3, 2026 21:3012,253111,583,315100,569,0001,132,0002,113,536
3Sep 3, 2026 21:3012,258111,484,109100,726,0001,016,0002,113,536
4Sep 3, 2026 21:3012,426113,053,757102,017,0001,120,0002,113,536
5Sep 3, 2026 21:3012,436113,087,840102,138,0001,081,0002,113,536
6Sep 3, 2026 21:3012,448113,178,487102,314,0001,008,0002,113,536
7Sep 3, 2026 21:3012,468114,465,585102,476,0001,014,0002,113,536
8Sep 3, 2026 21:3012,470116,490,472102,249,0001,255,0002,113,536
9Sep 3, 2026 21:3012,488113,682,389102,569,0001,085,0002,113,536