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 listMay 11, 2026 08:02wnwnScore: 3,783Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 08:033,78139,411,90730,275,0001,115,0002,113,536
2May 11, 2026 08:033,78240,471,23130,269,0001,126,0002,113,536
3May 11, 2026 08:033,78240,853,71630,337,0001,054,0002,113,536
4May 11, 2026 08:033,78239,913,86330,280,0001,113,0002,113,536
5May 11, 2026 08:033,78341,996,79330,336,0001,063,0002,113,536
6May 11, 2026 08:033,78340,713,56830,300,0001,106,0002,113,536
7May 11, 2026 08:033,78339,030,06130,285,0001,121,0002,113,536
8May 11, 2026 08:033,78440,471,08230,326,0001,082,0002,113,536
9May 11, 2026 08:033,78438,906,50530,333,0001,078,0002,113,536