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 9, 2026 14:42wnwnScore: 3,517Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 14:423,39542,727,69927,111,0001,072,0002,465,792
2May 9, 2026 14:423,39743,728,35227,108,0001,092,0002,486,272
3May 9, 2026 14:423,40043,850,49327,154,0001,072,0002,478,080
4May 9, 2026 14:423,40340,901,21327,133,0001,116,0002,330,624
5May 9, 2026 14:423,51741,829,52528,121,0001,077,0002,486,272
6May 9, 2026 14:423,52743,144,80228,229,0001,050,0002,486,272
7May 9, 2026 14:423,52746,899,33628,198,0001,077,0002,486,272
8May 9, 2026 14:423,54045,048,61528,296,0001,089,0002,482,176
9May 9, 2026 14:423,56246,896,80328,478,0001,093,0002,494,464