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: 272,130Success
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:20270,9372,259,096,8312,246,775,0002,006,0002,117,632stderr
2Sep 17, 2026 13:20272,0002,267,940,6812,255,595,0002,008,0002,117,632stderr
3Sep 17, 2026 13:20272,0742,268,483,0302,256,088,0002,133,0002,117,632stderr
4Sep 17, 2026 13:20272,1062,268,845,3512,256,471,0002,017,0002,117,632stderr
5Sep 17, 2026 13:20272,1302,270,321,8052,256,679,0002,008,0002,117,632stderr
6Sep 17, 2026 13:20272,2332,269,720,1092,257,361,0002,180,0002,117,632stderr
7Sep 17, 2026 13:20272,4682,271,816,7392,259,476,0002,011,0002,117,632stderr
8Sep 17, 2026 13:20273,1422,277,380,7472,264,995,0002,086,0002,117,632stderr
9Sep 17, 2026 13:20273,3562,279,185,1032,266,817,0002,042,0002,117,632stderr