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 15:13Andrew EpsteinAndrew EpsteinScore: 3,737Success
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 15:153,67839,304,53129,489,0001,039,0002,113,536
2Sep 17, 2026 15:153,69739,488,38529,660,0001,031,0002,113,536
3Sep 17, 2026 15:153,73339,755,53129,918,0001,066,0002,113,536
4Sep 17, 2026 15:153,73441,047,56229,920,0001,077,0002,113,536
5Sep 17, 2026 15:153,73739,712,08229,979,0001,039,0002,113,536
6Sep 17, 2026 15:153,74039,751,55230,002,0001,041,0002,113,536
7Sep 17, 2026 15:153,75039,840,91429,967,0001,161,0002,113,536
8Sep 17, 2026 15:153,75139,865,27030,100,0001,041,0002,113,536
9Sep 17, 2026 15:153,77340,034,04830,272,0001,050,0002,113,536