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 3, 2026 15:54boop34boop34Score: 10,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 15:5410,42196,360,75185,409,0001,088,0002,113,536
2Sep 3, 2026 15:5410,44796,615,23285,626,0001,089,0002,113,536
3Sep 3, 2026 15:5410,44898,642,57585,644,0001,076,0002,113,536
4Sep 3, 2026 15:5410,45296,587,90085,673,0001,082,0002,113,536
5Sep 3, 2026 15:5410,46396,663,62485,763,0001,080,0002,113,536
6Sep 3, 2026 15:5410,46796,695,48485,876,0001,003,0002,113,536
7Sep 3, 2026 15:5410,48696,927,75785,956,0001,081,0002,113,536
8Sep 3, 2026 15:5410,49197,052,57885,994,0001,085,0002,113,536
9Sep 3, 2026 15:5410,51198,229,43986,157,0001,088,0002,113,536