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 listFeb 18, 2026 20:00wnwnScore: 7,245Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 20:007,22182,973,95255,937,0003,995,0002,437,120
2Feb 18, 2026 20:007,24584,086,61758,129,0002,004,0002,428,928
3Feb 18, 2026 20:007,30284,983,87059,596,0001,010,0002,461,696