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 10, 2026 10:32wnwnScore: 3,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:333,37641,193,42026,981,0001,048,0002,486,272
2May 10, 2026 10:333,39745,473,46927,114,0001,082,0002,486,272
3May 10, 2026 10:333,41443,670,97627,235,0001,108,0002,482,176
4May 10, 2026 10:333,52843,994,86228,204,0001,084,0002,494,464
5May 10, 2026 10:333,53746,550,03728,310,0001,051,0002,494,464
6May 10, 2026 10:333,56342,635,02628,525,0001,050,0002,486,272
7May 10, 2026 10:333,58344,579,40828,650,0001,089,0002,486,272
8May 10, 2026 10:333,58646,842,51528,698,0001,069,0002,482,176
9May 10, 2026 10:333,59043,581,24428,729,0001,069,0002,478,080