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 6, 2026 11:55Kevin HeaveyKevin HeaveyScore: 3,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 11:563,52537,757,34728,197,0001,061,0002,113,536
2Sep 6, 2026 11:563,60838,394,41328,744,0001,210,0002,113,536
3Sep 6, 2026 11:563,64638,773,77229,045,0001,217,0002,113,536
4Sep 6, 2026 11:563,65038,762,46329,118,0001,184,0002,113,536
5Sep 6, 2026 11:563,71339,324,28729,742,0001,084,0002,113,536
6Sep 6, 2026 11:563,74640,393,73530,060,0001,036,0002,113,536
7Sep 6, 2026 11:563,75540,418,34229,972,0001,201,0002,113,536
8Sep 6, 2026 11:563,76640,451,89630,029,0001,230,0002,113,536
9Sep 6, 2026 11:563,80540,051,60130,357,0001,227,0002,113,536