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 listSep 17, 2026 00:04Andrew EpsteinAndrew EpsteinScore: 3,647Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 00:053,63140,281,41229,030,0001,110,0002,113,536
2Sep 17, 2026 00:053,63140,309,33429,027,0001,117,0002,113,536
3Sep 17, 2026 00:053,63440,695,76829,059,0001,105,0002,113,536
4Sep 17, 2026 00:053,63440,306,30229,062,0001,107,0002,113,536
5Sep 17, 2026 00:053,64740,499,47429,129,0001,146,0002,113,536
6Sep 17, 2026 00:053,65140,407,51729,189,0001,118,0002,113,536
7Sep 17, 2026 00:053,67640,738,69129,314,0001,197,0002,113,536
8Sep 17, 2026 00:053,69140,763,87029,528,0001,114,0002,113,536
9Sep 17, 2026 00:053,71441,446,20429,702,0001,126,0002,113,536