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 23, 2025 22:34Dmitry YudakovDmitry YudakovScore: 79,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 22:3479,436684,452,013658,317,0001,000,0002,297,856
2Apr 23, 2025 22:3479,438689,797,227657,332,0002,001,0002,535,424
3Apr 23, 2025 22:3479,445688,097,088657,395,0001,998,0002,535,424
4Apr 23, 2025 22:3479,452691,284,070657,453,0001,998,0002,297,856
5Apr 23, 2025 22:3479,457691,880,989657,495,0001,998,0002,293,760
6Apr 23, 2025 22:3479,461688,691,857655,532,0003,997,0002,543,616
7Apr 23, 2025 22:3479,465686,427,050658,556,0001,000,0002,535,424
8Apr 23, 2025 22:3479,471685,535,696657,609,0001,998,0002,543,616
9Apr 23, 2025 22:3479,475686,697,416657,642,0001,998,0002,293,760