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 7, 2026 14:46Kevin PetersKevin PetersScore: 70,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 14:4770,748597,271,711530,026,00057,184,0002,113,536
2Sep 7, 2026 14:4770,754597,132,469530,361,00056,898,0002,113,536
3Sep 7, 2026 14:4770,755597,247,607530,169,00057,098,0002,113,536
4Sep 7, 2026 14:4770,816597,816,561529,830,00057,951,0002,113,536
5Sep 7, 2026 14:4770,819597,797,520530,158,00057,641,0002,113,536
6Sep 7, 2026 14:4770,850598,580,825530,153,00057,908,0002,113,536
7Sep 7, 2026 14:4770,897598,339,836530,321,00058,130,0002,113,536
8Sep 7, 2026 14:4770,958598,891,647530,287,00058,672,0002,113,536
9Sep 7, 2026 14:4771,012599,405,433529,994,00059,406,0002,113,536