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 20, 2026 21:59Andrew EpsteinAndrew EpsteinScore: 89,029Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2026 21:5989,000748,571,309679,975,00058,727,0002,113,536
2Aug 20, 2026 21:5989,003748,593,859679,899,00058,832,0002,113,536
3Aug 20, 2026 21:5989,016748,777,880680,259,00058,581,0002,113,536
4Aug 20, 2026 21:5989,025748,785,120679,868,00059,047,0002,113,536
5Aug 20, 2026 21:5989,029748,674,842680,125,00058,817,0002,113,536
6Aug 20, 2026 21:5989,052749,099,567680,264,00058,868,0002,113,536
7Aug 20, 2026 21:5989,057749,109,137679,957,00059,221,0002,113,536
8Aug 20, 2026 21:5989,070749,111,846680,073,00059,211,0002,113,536
9Aug 20, 2026 21:5989,077749,179,988680,397,00058,948,0002,113,536