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 listSep 17, 2026 01:51Andrew EpsteinAndrew EpsteinScore: 69,081Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 01:5268,560579,338,762568,040,0001,009,0002,117,632stderr
2Sep 17, 2026 01:5268,671580,284,802568,974,0001,001,0002,117,632stderr
3Sep 17, 2026 01:5268,724580,544,955569,413,0001,002,0002,117,632stderr
4Sep 17, 2026 01:5268,854581,780,089569,460,0002,034,0002,117,632stderr
5Sep 17, 2026 01:5269,081583,628,822572,365,0001,010,0002,117,632stderr
6Sep 17, 2026 01:5269,095583,745,037572,485,0001,008,0002,117,632stderr
7Sep 17, 2026 01:5269,200584,545,208573,360,0001,004,0002,117,632stderr
8Sep 17, 2026 01:5269,306585,563,672574,241,0001,002,0002,117,632stderr
9Sep 17, 2026 01:5269,650588,253,774577,097,0001,001,0002,117,632stderr