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 17, 2026 13:15Andrew EpsteinAndrew EpsteinScore: 263,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 13:18262,1262,186,135,8822,173,639,0002,012,0002,117,632stderr
2Sep 17, 2026 13:18262,6832,190,545,1492,178,216,0002,056,0002,117,632stderr
3Sep 17, 2026 13:18262,6952,190,787,5302,178,366,0002,003,0002,117,632stderr
4Sep 17, 2026 13:18262,9252,192,591,4272,180,266,0002,012,0002,117,632stderr
5Sep 17, 2026 13:18263,0122,194,465,1852,180,804,0002,197,0002,117,632stderr
6Sep 17, 2026 13:18263,1162,194,223,3332,181,787,0002,082,0002,117,632stderr
7Sep 17, 2026 13:18263,2462,196,591,9482,182,739,0002,204,0002,117,632stderr
8Sep 17, 2026 13:18263,3382,196,100,2052,183,544,0002,162,0002,117,632stderr
9Sep 17, 2026 13:18264,1132,203,689,0452,190,139,0002,006,0002,117,632stderr