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:29Andrew EpsteinAndrew EpsteinScore: 88,452Success
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:2988,162741,947,622730,728,0001,020,0002,117,632stderr
2Sep 17, 2026 01:2988,273742,899,452731,664,0001,002,0002,117,632stderr
3Sep 17, 2026 01:2988,330743,406,541732,142,0001,001,0002,117,632stderr
4Sep 17, 2026 01:2988,385743,976,532732,596,0001,003,0002,117,632stderr
5Sep 17, 2026 01:2988,452744,399,021733,158,0001,001,0002,117,632stderr
6Sep 17, 2026 01:2988,538745,083,945733,859,0001,008,0002,117,632stderr
7Sep 17, 2026 01:2988,546745,807,532733,922,0001,010,0002,117,632stderr
8Sep 17, 2026 01:2988,564745,314,124734,079,0001,007,0002,117,632stderr
9Sep 17, 2026 01:2988,883747,858,889736,726,0001,003,0002,121,728stderr