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 listSep 17, 2025 06:31Aleksei ShahoikaAleksei ShahoikaScore: 19,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 06:3119,159188,216,380158,018,0001,000,0002,285,568
2Sep 17, 2025 06:3119,159180,471,729157,016,0002,000,0002,265,088
3Sep 17, 2025 06:3119,173183,397,331157,131,0002,001,0002,260,992
4Sep 17, 2025 06:3119,173181,661,660157,135,0002,001,0002,260,992
5Sep 17, 2025 06:3119,175183,698,520158,153,0001,000,0002,269,184
6Sep 17, 2025 06:3119,178190,374,718157,176,0002,002,0002,273,280
7Sep 17, 2025 06:3119,180182,037,881157,192,0002,002,0002,285,568
8Sep 17, 2025 06:3119,192181,604,109157,292,0002,003,0002,285,568
9Sep 17, 2025 06:3119,197188,250,279158,330,0001,002,0002,285,568