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 25, 2026 12:10Victor MerckléVictor MerckléScore: 16,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 12:1116,223142,863,970133,586,0001,067,0002,117,632stderr
2Aug 25, 2026 12:1116,227143,057,213133,663,0001,029,0002,117,632stderr
3Aug 25, 2026 12:1116,296144,359,056134,193,0001,068,0002,117,632stderr
4Aug 25, 2026 12:1116,328143,873,992134,459,0001,066,0002,117,632stderr
5Aug 25, 2026 12:1116,669146,685,851137,349,0001,010,0002,117,632stderr
6Aug 25, 2026 12:1116,684146,852,375137,449,0001,033,0002,117,632stderr
7Aug 25, 2026 12:1116,753147,366,909138,044,0001,012,0002,117,632stderr
8Aug 25, 2026 12:1116,771147,592,220138,202,0001,001,0002,117,632stderr
9Aug 25, 2026 12:1116,773147,576,877138,150,0001,072,0002,117,632stderr