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 12:26wnwnScore: 3,475Success
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 12:343,32536,388,21326,595,0001,008,0002,113,536
2Sep 24, 2026 12:343,32736,980,67326,577,0001,038,0002,113,536
3Sep 24, 2026 12:343,33736,521,24726,663,0001,040,0002,113,536
4Sep 24, 2026 12:343,43137,255,06627,445,0001,038,0002,113,536
5Sep 24, 2026 12:343,47537,632,30027,809,0001,035,0002,113,536
6Sep 24, 2026 12:343,47938,346,99327,835,0001,042,0002,113,536
7Sep 24, 2026 12:345,07250,761,51728,349,00013,756,0002,113,536
8Sep 24, 2026 12:345,15352,111,22228,172,00014,603,0002,113,536
9Sep 24, 2026 12:345,22652,751,67328,107,00015,274,0002,113,536