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 18:57wnwnScore: 5,078Success
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 18:575,04273,288,21539,855,0001,992,0002,494,464
2Feb 20, 2026 18:585,05666,911,59239,968,0001,998,0002,277,376
3Feb 20, 2026 18:585,06367,457,80740,021,0002,001,0002,277,376
4Feb 20, 2026 18:575,07870,673,51340,138,0002,006,0002,277,376
5Feb 20, 2026 18:585,07863,855,16140,144,0002,007,0002,277,376
6Feb 20, 2026 18:575,12275,826,53741,499,0001,012,0002,494,464