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 26, 2025 18:41hunaphuhunaphuScore: 57,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 18:4157,373503,913,795417,170,00059,024,0002,273,280
2Dec 26, 2025 18:4157,451503,463,304418,863,00057,981,0002,400,256
3Dec 26, 2025 18:4157,451507,206,697414,862,00061,979,0002,273,280
4Dec 26, 2025 18:4157,511500,575,653418,303,00059,042,0002,273,280
5Dec 26, 2025 18:4157,520506,973,027417,362,00060,052,0002,392,064
6Dec 26, 2025 18:4157,522503,565,143415,377,00062,056,0002,273,280
7Dec 26, 2025 18:4157,640503,371,326414,361,00064,055,0002,396,160
8Dec 26, 2025 18:4157,691502,384,521416,854,00061,978,0002,273,280
9Dec 26, 2025 18:4157,750505,012,085419,286,00060,041,0002,273,280