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 listAug 11, 2025 16:58Ian MckibbenIan MckibbenScore: 14,431Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 16:5814,410146,738,617119,602,00002,531,328
2Aug 11, 2025 16:5814,412151,297,770119,623,00002,269,184
3Aug 11, 2025 16:5814,425146,661,233118,729,000997,0002,433,024
4Aug 11, 2025 16:5814,431147,971,940118,780,000998,0002,433,024
5Aug 11, 2025 16:5814,431145,902,821118,781,000998,0002,433,024
6Aug 11, 2025 16:5814,431152,359,942118,781,000998,0002,420,736
7Aug 11, 2025 16:5814,431147,367,146119,776,00002,531,328
8Aug 11, 2025 16:5814,431149,679,480118,778,000998,0002,531,328
9Aug 11, 2025 16:5815,825155,699,085131,348,00002,531,328