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 24, 2026 16:50flavio87flavio87Score: 3,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 16:503,54738,256,99028,439,0001,006,0002,113,536
2Sep 24, 2026 16:503,55038,279,33728,370,0001,098,0002,113,536
3Sep 24, 2026 16:503,55438,376,98028,407,0001,095,0002,113,536
4Sep 24, 2026 16:503,56939,098,64828,554,0001,073,0002,113,536
5Sep 24, 2026 16:503,58039,076,81228,626,0001,093,0002,113,536
6Sep 24, 2026 16:503,58639,291,69628,677,0001,087,0002,113,536
7Sep 24, 2026 16:504,04043,069,29932,489,0001,043,0002,113,536
8Sep 24, 2026 16:504,33449,197,86634,926,0001,052,0002,113,536
9Sep 24, 2026 16:504,41849,773,15535,602,0001,071,0002,113,536