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 07:32marko1597marko1597Score: 127,984Success
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 07:51127,2751,066,441,1091,055,245,0001,141,0002,117,632stderr
2Aug 16, 2026 07:51127,7881,070,763,6011,059,385,0001,259,0002,117,632stderr
3Aug 16, 2026 07:51127,8741,071,345,0561,060,116,0001,244,0002,117,632stderr
4Aug 16, 2026 07:51127,9811,072,267,8651,061,095,0001,150,0002,117,632stderr
5Aug 16, 2026 07:51127,9841,072,387,0631,061,267,0001,003,0002,117,632stderr
6Aug 16, 2026 07:51128,0671,073,001,6711,061,960,0001,001,0002,117,632stderr
7Aug 16, 2026 07:51128,2301,074,352,4521,063,163,0001,153,0002,117,632stderr
8Aug 16, 2026 07:51128,5511,077,099,5321,065,800,0001,181,0002,117,632stderr
9Aug 16, 2026 07:51128,5661,077,299,9451,066,087,0001,012,0002,117,632stderr