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 listFeb 17, 2026 19:05wnwnScore: 7,591Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 19:057,42393,471,80858,582,0003,030,0002,420,736
2Feb 17, 2026 19:057,48488,915,36459,109,0003,005,0002,383,872
3Feb 17, 2026 19:057,49086,940,67359,160,0003,008,0002,420,736
4Feb 17, 2026 19:057,50187,698,79560,250,0002,008,0002,482,176
5Feb 17, 2026 19:057,59190,120,44260,009,0003,000,0002,478,080
6Feb 17, 2026 19:057,70493,672,92760,949,0002,997,0002,392,064
7Feb 17, 2026 19:057,77897,305,64961,533,0003,026,0002,387,968
8Feb 17, 2026 19:057,78689,264,54361,591,0003,029,0002,465,792
9Feb 17, 2026 19:057,82186,733,33260,923,0003,995,0002,416,640