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 07:08wnwnScore: 3,473Success
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 07:093,32536,401,17726,603,0001,002,0002,113,536
2Sep 24, 2026 07:093,32636,458,11126,585,0001,023,0002,113,536
3Sep 24, 2026 07:093,44938,067,71827,597,0001,034,0002,113,536
4Sep 24, 2026 07:093,46737,566,17027,758,0001,020,0002,113,536
5Sep 24, 2026 07:093,47338,278,72227,738,0001,093,0002,113,536
6Sep 24, 2026 07:093,49438,467,58827,961,0001,042,0002,113,536
7Sep 24, 2026 07:093,49838,434,02327,902,0001,135,0002,113,536
8Sep 24, 2026 07:093,50638,605,54928,085,0001,015,0002,113,536
9Sep 24, 2026 07:093,52038,675,99528,219,0001,005,0002,113,536