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 13:23wnwnScore: 4,170Success
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 13:233,60038,516,16926,434,0003,449,0002,113,536
2Sep 24, 2026 13:233,75039,882,22327,758,0003,372,0002,113,536
3Sep 24, 2026 13:233,75439,840,31227,922,0003,241,0002,113,536
4Sep 24, 2026 13:234,07443,120,92826,497,0007,324,0002,113,536
5Sep 24, 2026 13:234,17043,303,56526,577,0008,040,0002,113,536
6Sep 24, 2026 13:234,26444,021,80127,934,0007,458,0002,113,536
7Sep 24, 2026 13:234,49245,853,39826,933,00010,358,00020,480
8Sep 24, 2026 13:234,72347,972,94128,974,00010,229,00020,480
9Sep 24, 2026 13:234,78249,081,60927,984,00011,710,00020,480