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 1, 2026 19:15George SeabridgeGeorge SeabridgeScore: 8,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 19:168,59681,368,23470,269,0001,083,0002,113,536
2Aug 1, 2026 19:168,60081,398,05770,299,0001,089,0002,113,536
3Aug 1, 2026 19:168,60981,534,13070,375,0001,080,0002,113,536
4Aug 1, 2026 19:168,61581,509,85170,415,0001,090,0002,113,536
5Aug 1, 2026 19:168,61686,281,49070,417,0001,097,0002,113,536
6Aug 1, 2026 19:169,70291,307,45579,438,0001,093,0002,113,536
7Aug 1, 2026 19:169,71191,387,99179,513,0001,091,0002,113,536
8Aug 1, 2026 19:169,71591,599,97079,553,0001,086,0002,113,536
9Aug 1, 2026 19:169,72091,456,70379,575,0001,101,0002,113,536