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 12, 2026 14:55Victor MerckléVictor MerckléScore: 4,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 14:564,53646,083,87936,606,0001,045,0002,117,632stderr
2Aug 12, 2026 14:564,55846,011,11636,789,0001,048,0002,117,632stderr
3Aug 12, 2026 14:564,57046,351,75536,788,0001,146,0002,117,632stderr
4Aug 12, 2026 14:564,57146,323,68936,837,0001,104,0002,117,632stderr
5Aug 12, 2026 14:564,57846,196,61836,857,0001,141,0002,117,632stderr
6Aug 12, 2026 14:564,61146,547,23037,166,0001,112,0002,117,632stderr
7Aug 12, 2026 14:564,62846,566,14937,342,0001,076,0002,117,632stderr
8Aug 12, 2026 14:564,65947,186,02437,620,0001,055,0002,117,632stderr
9Aug 12, 2026 14:564,81048,340,09238,859,0001,070,0002,117,632stderr