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 listAug 16, 2026 00:06marko1597marko1597Score: 135,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 00:41134,5411,126,781,0011,115,460,0001,238,0002,117,632stderr
2Aug 16, 2026 00:41134,8211,129,775,8471,117,789,0001,226,0002,117,632stderr
3Aug 16, 2026 00:41135,8311,137,638,6241,126,395,0001,008,0002,117,632stderr
4Aug 16, 2026 00:41135,8471,137,758,0581,125,493,0002,044,0002,117,632stderr
5Aug 16, 2026 00:41135,8531,138,379,7811,126,349,0001,239,0002,117,632stderr
6Aug 16, 2026 00:41135,9051,138,220,6231,125,830,0002,189,0002,117,632stderr
7Aug 16, 2026 00:41136,0601,139,308,2591,128,031,0001,267,0002,117,632stderr
8Aug 16, 2026 00:41136,3571,142,596,1551,130,510,0001,258,0002,117,632stderr
9Aug 16, 2026 00:41136,4881,151,558,6081,131,852,0001,004,0002,117,632stderr