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 09:25Aman | अमनAman | अमनScore: 75,401Success
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 09:2575,294643,345,860569,945,00054,994,0002,273,280
2Dec 29, 2025 09:2575,298651,295,794560,977,00063,997,0002,273,280
3Dec 29, 2025 09:2575,308650,068,665562,048,00063,005,0002,281,472
4Dec 29, 2025 09:2575,364651,792,713582,555,00042,967,0002,281,472
5Dec 29, 2025 09:2575,401652,222,983576,843,00048,986,0002,273,280
6Dec 29, 2025 09:2575,412649,306,446567,925,00057,992,0002,387,968
7Dec 29, 2025 09:2575,431649,292,125544,068,00082,010,0002,387,968
8Dec 29, 2025 09:2575,491655,933,611569,612,00056,961,0002,281,472
9Dec 29, 2025 09:2575,545650,117,347562,025,00065,002,0002,371,584