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 listFeb 27, 2026 13:35Genos0Genos0Score: 71,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 13:3571,247621,968,793531,312,00060,035,0002,281,472
2Feb 27, 2026 13:3571,254621,165,763537,370,00054,037,0002,293,760
3Feb 27, 2026 13:3571,268617,715,040531,570,00059,951,0002,281,472
4Feb 27, 2026 13:3571,273618,343,207534,609,00056,958,0002,379,776
5Feb 27, 2026 13:3571,274615,296,481533,614,00057,958,0002,281,472
6Feb 27, 2026 13:3571,280621,170,675532,559,00059,062,0002,281,472
7Feb 27, 2026 13:3571,305613,997,507537,849,00053,984,0002,281,472
8Feb 27, 2026 13:3571,338614,265,081534,097,00058,010,0002,281,472
9Feb 27, 2026 13:3571,362614,322,097531,275,00061,031,0002,387,968