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 listApr 19, 2026 04:11wnwnScore: 3,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2026 04:113,69559,813,24529,647,0001,022,0002,269,184
2Apr 19, 2026 04:113,69659,555,43829,654,0001,022,0002,531,328
3Apr 19, 2026 04:113,69860,584,28229,671,0001,023,0002,531,328
4Apr 19, 2026 04:113,71556,844,93528,849,0001,989,0002,531,328
5Apr 19, 2026 04:113,71560,122,33329,837,000994,0002,531,328
6Apr 19, 2026 04:113,71854,671,21528,868,0001,990,0002,269,184
7Apr 19, 2026 04:113,73156,656,18628,972,0001,998,0002,494,464
8Apr 19, 2026 04:113,85751,847,29530,014,0002,000,0002,490,368
9Apr 19, 2026 04:113,86853,280,88430,102,0002,006,0002,531,328