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 20, 2026 16:26wnwnScore: 5,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 16:265,17762,760,42540,975,0001,998,0002,498,560
2Feb 20, 2026 16:265,17864,335,23440,982,0001,999,0002,494,464
3Feb 20, 2026 16:265,24272,292,19242,501,0001,011,0002,277,376