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 2, 2026 07:25Andrey TsvetkovAndrey TsvetkovScore: 40,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 07:2640,518348,082,002334,144,0002,159,0002,138,112
2Aug 2, 2026 07:2640,526347,663,736334,228,0002,139,0002,138,112
3Aug 2, 2026 07:2640,534347,873,838333,206,0003,233,0002,138,112
4Aug 2, 2026 07:2640,536347,174,698334,298,0002,151,0002,138,112
5Aug 2, 2026 07:2640,538347,491,197333,260,0003,212,0002,138,112
6Aug 2, 2026 07:2640,542350,659,696334,347,0002,153,0002,138,112
7Aug 2, 2026 07:2640,542348,109,806334,300,0002,204,0002,138,112
8Aug 2, 2026 07:2640,543347,676,452334,333,0002,177,0002,138,112
9Aug 2, 2026 07:2640,548347,851,034334,355,0002,198,0002,138,112