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 4, 2026 11:06limanjun99limanjun99Score: 4,394Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2026 11:064,34351,965,47733,792,0002,263,0002,494,464
2May 4, 2026 11:064,36652,595,90733,097,0003,145,0002,494,464
3May 4, 2026 11:064,38054,166,23533,118,0003,236,0002,498,560
4May 4, 2026 11:064,39052,644,07334,172,0002,265,0002,498,560
5May 4, 2026 11:064,39454,442,32534,198,0002,277,0002,498,560
6May 4, 2026 11:064,40455,481,34833,461,0003,093,0002,498,560
7May 4, 2026 11:064,41852,556,59433,519,0003,154,0002,502,656
8May 4, 2026 11:064,46455,172,98733,971,0003,082,0002,502,656
9May 4, 2026 11:064,50753,031,70034,302,0003,111,0002,506,752