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 24, 2026 05:27wnwnScore: 3,707Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 05:283,67439,314,60229,463,0001,033,0002,113,536
2Sep 24, 2026 05:283,67539,241,98929,499,0001,010,0002,113,536
3Sep 24, 2026 05:283,68439,273,66629,577,0001,007,0002,113,536
4Sep 24, 2026 05:283,68839,426,29829,574,0001,044,0002,113,536
5Sep 24, 2026 05:283,70739,470,66629,690,0001,079,0002,113,536
6Sep 24, 2026 05:283,70740,233,61229,685,0001,086,0002,113,536
7Sep 24, 2026 05:283,70839,614,80429,704,0001,077,0002,113,536
8Sep 24, 2026 05:283,71239,584,00429,731,0001,082,0002,113,536
9Sep 24, 2026 05:283,71539,497,51329,762,0001,075,0002,113,536