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 25, 2026 15:43Victor MerckléVictor MerckléScore: 11,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 15:4411,154100,903,35490,356,0002,226,0002,117,632stderr
2Aug 25, 2026 15:4411,176101,090,60290,544,0002,224,0002,117,632stderr
3Aug 25, 2026 15:4411,365102,745,95992,065,0002,270,0002,117,632stderr
4Aug 25, 2026 15:4411,385102,882,37692,216,0002,280,0002,117,632stderr
5Aug 25, 2026 15:4411,409104,859,19692,488,0002,207,0002,117,632stderr
6Aug 25, 2026 15:4411,450103,419,09792,761,0002,274,0002,117,632stderr
7Aug 25, 2026 15:4411,473103,547,26592,943,0002,283,0002,117,632stderr
8Aug 25, 2026 15:4411,484103,648,59293,098,0002,227,0002,117,632stderr
9Aug 25, 2026 15:4411,634104,966,65094,342,0002,225,0002,117,632stderr