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 27, 2025 14:01AkashAkashScore: 265,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 27, 2025 14:01264,5192,222,331,5722,119,559,00075,948,0002,285,568
2Dec 27, 2025 14:01264,6052,224,394,2102,128,246,00067,975,0002,293,760
3Dec 27, 2025 14:01264,9352,223,675,1732,119,997,00078,962,0002,289,664
4Dec 27, 2025 14:01265,0522,224,029,2102,140,957,00058,971,0002,285,568
5Dec 27, 2025 14:01265,1362,222,374,6382,136,669,00063,960,0002,293,760
6Dec 27, 2025 14:01265,2942,224,070,1422,137,975,00063,969,0002,510,848
7Dec 27, 2025 14:01265,3792,228,135,9882,129,689,00072,955,0002,289,664
8Dec 27, 2025 14:01265,5482,231,928,9262,126,084,00077,966,0002,289,664
9Dec 27, 2025 14:01265,6112,231,015,1182,112,589,00091,982,0002,293,760