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 23, 2026 20:05Victor MerckléVictor MerckléScore: 3,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 20:063,74239,514,86929,931,0001,129,0002,117,632stderr
2Aug 23, 2026 20:063,74440,458,92229,787,0001,296,0002,117,632stderr
3Aug 23, 2026 20:063,75339,572,51830,032,0001,119,0002,117,632stderr
4Aug 23, 2026 20:063,76740,383,14130,142,0001,131,0002,117,632stderr
5Aug 23, 2026 20:063,77639,734,54530,258,0001,083,0002,117,632stderr
6Aug 23, 2026 20:063,78740,577,15830,267,0001,171,0002,117,632stderr
7Aug 23, 2026 20:063,79439,869,18130,425,0001,067,0002,117,632stderr
8Aug 23, 2026 20:063,81040,003,87630,511,0001,117,0002,117,632stderr
9Aug 23, 2026 20:063,82940,182,70330,706,0001,077,0002,117,632stderr