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 listOct 2, 2026 18:05Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 18:06014,132,82705,309,00028,672expected "53687073733323560 ", got "in=/mnt/hldata/data2530108939 size=524126898 fstype=1021994 blocks=1023688 pop=0 2078us | 40000000-5f3d9000 r--p 00000000 00:23 592946 /mnt/hldata/data2530108939; Rss: 511844 ...
2Oct 2, 2026 18:06014,453,09705,615,00028,672expected "53686254562596224 ", got "in=/mnt/hldata/data2342855649 size=524128516 fstype=1021994 blocks=1023696 pop=0 2221us | 40000000-5f3da000 r--p 00000000 00:23 592947 /mnt/hldata/data2342855649; Rss: 511848 ...
3Oct 2, 2026 18:06015,793,32805,550,00028,672expected "53687967230348221 ", got "in=/mnt/hldata/data3632686138 size=524132241 fstype=1021994 blocks=1023696 pop=0 2191us | 40000000-5f3da000 r--p 00000000 00:23 592948 /mnt/hldata/data3632686138; Rss: 511848 ...