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 14, 2026 17:39marko1597marko1597Score: 193,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 17:39192,1241,604,863,9141,592,622,0002,012,0002,117,632stderr
2Aug 14, 2026 17:39192,3851,606,930,5491,595,790,0001,006,0002,117,632stderr
3Aug 14, 2026 17:39193,0151,612,128,8771,600,863,0001,165,0002,117,632stderr
4Aug 14, 2026 17:39193,1671,613,489,3821,602,287,0001,002,0002,117,632stderr
5Aug 14, 2026 17:39193,2541,614,020,2201,602,857,0001,156,0002,117,632stderr
6Aug 14, 2026 17:39193,2731,614,186,0541,603,009,0001,164,0002,117,632stderr
7Aug 14, 2026 17:39193,3841,615,268,0771,603,896,0001,196,0002,117,632stderr
8Aug 14, 2026 17:39193,5681,616,747,4071,605,615,0001,002,0002,117,632stderr
9Aug 14, 2026 17:39193,5721,616,820,9661,605,489,0001,161,0002,117,632stderr