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 30, 2026 14:31parastromparastromScore: 3,968Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 14:333,85841,836,77930,944,0001,078,0002,113,536
2Sep 30, 2026 14:333,92142,080,59031,417,0001,130,0002,113,536
3Sep 30, 2026 14:333,95041,815,10731,608,0001,184,0002,113,536
4Sep 30, 2026 14:333,95541,819,84831,693,0001,139,0002,113,536
5Sep 30, 2026 14:333,96841,879,16031,853,0001,085,0002,113,536
6Sep 30, 2026 14:333,97142,065,08931,831,0001,134,0002,113,536
7Sep 30, 2026 14:333,98142,123,63332,029,0001,020,0002,113,536
8Sep 30, 2026 14:334,01442,352,65832,182,0001,142,0002,113,536
9Sep 30, 2026 14:334,04642,600,81932,463,0001,127,0002,113,536