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 listMar 25, 2026 14:18Dominique GarmierDominique GarmierScore: 275,287Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 14:18274,9242,306,412,5622,279,874,0001,998,0002,277,376
2Mar 25, 2026 14:32275,1192,303,378,9632,282,490,000999,0002,478,080
3Mar 25, 2026 14:32275,2072,311,388,4042,282,220,0001,998,0002,277,376
4Mar 25, 2026 14:18275,2872,311,121,1112,282,880,0001,999,0002,473,984
5Mar 25, 2026 14:18275,3242,313,488,7172,283,190,0001,998,0002,277,376
6Mar 25, 2026 14:32275,4202,309,587,8202,284,988,000999,0002,277,376