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 2, 2026 19:40leoweleoweScore: 55,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2026 19:4055,791490,073,090461,066,0002,000,0002,469,888
2Apr 2, 2026 19:4055,796499,706,592460,107,0003,000,0002,338,816
3Apr 2, 2026 19:4055,798498,322,237460,123,0003,000,0002,473,984
4Apr 2, 2026 19:4055,802490,025,321462,154,0001,000,0002,375,680
5Apr 2, 2026 19:4055,811491,596,690462,230,0001,000,0002,461,696
6Apr 2, 2026 19:4055,812497,826,841461,242,0002,001,0002,379,776
7Apr 2, 2026 19:4055,813491,366,448461,245,0002,001,0002,371,584
8Apr 2, 2026 19:4055,821494,962,277459,315,0004,002,0002,465,792
9Apr 2, 2026 19:4055,853490,809,105459,584,0003,996,0002,551,808