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 listDec 9, 2025 19:20pseppsepScore: 62,094Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 19:2061,992539,661,898457,587,00056,948,0002,265,088
2Dec 9, 2025 19:2062,018538,173,205459,776,00054,973,0002,285,568
3Dec 9, 2025 19:2062,051542,793,348456,020,00059,002,0002,285,568
4Dec 9, 2025 19:2062,085542,822,128457,385,00057,922,0002,367,488
5Dec 9, 2025 19:2062,094542,082,490458,337,00057,042,0002,269,184
6Dec 9, 2025 19:2062,101545,877,006457,389,00058,049,0002,273,280
7Dec 9, 2025 19:2062,142540,309,991456,804,00058,974,0002,408,448
8Dec 9, 2025 19:2062,206547,066,731456,275,00060,036,0002,285,568
9Dec 9, 2025 19:2062,240540,204,240453,643,00062,950,0002,285,568