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 29, 2025 10:40Aman | अमनAman | अमनScore: 71,222Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 10:4071,082611,739,530532,986,00056,998,0002,273,280
2Dec 29, 2025 10:4071,194615,617,411533,919,00056,991,0002,383,872
3Dec 29, 2025 10:4071,198616,157,336536,948,00053,994,0002,281,472
4Dec 29, 2025 10:4071,219615,314,848533,104,00058,011,0002,392,064
5Dec 29, 2025 10:4071,222618,929,826536,130,00055,013,0002,281,472
6Dec 29, 2025 10:4071,276624,682,752531,633,00059,958,0002,375,680
7Dec 29, 2025 10:4071,291617,665,666535,743,00055,973,0002,273,280
8Dec 29, 2025 10:4071,301615,713,785532,817,00058,979,0002,281,472
9Dec 29, 2025 10:4071,330614,652,576537,036,00055,003,0002,281,472