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 23, 2026 19:24wnwnScore: 4,387Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 23, 2026 19:244,37557,833,83135,306,0001,008,0002,535,424
2Feb 23, 2026 19:244,37562,962,19535,308,0001,008,0002,535,424
3Feb 23, 2026 19:254,37857,798,67635,330,0001,009,0002,527,232
4Feb 23, 2026 19:254,38766,344,52235,397,0001,011,0002,498,560
5Feb 23, 2026 19:254,40361,086,57635,533,0001,015,0002,535,424
6Feb 23, 2026 19:244,43765,387,87035,830,000995,0002,535,424