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 13:18wnwnScore: 3,419Success
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 13:183,26037,066,90827,060,00002,113,536
2May 10, 2026 13:183,27034,869,68627,144,00002,113,536
3May 10, 2026 13:183,27636,982,78827,195,00002,113,536
4May 10, 2026 13:183,41537,540,82328,347,00002,113,536
5May 10, 2026 13:183,41936,227,58628,384,00002,113,536
6May 10, 2026 13:183,42238,207,86427,399,0001,010,0002,113,536
7May 10, 2026 13:183,44338,818,84328,579,00002,113,536
8May 10, 2026 13:183,49137,396,93227,939,0001,043,0002,113,536
9May 10, 2026 13:183,50939,399,79629,130,00002,113,536