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 7, 2026 15:10Kevin PetersKevin PetersScore: 62,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:1062,405527,943,293461,243,00056,719,0002,113,536
2Sep 7, 2026 15:1062,473528,407,600461,539,00056,987,0002,113,536
3Sep 7, 2026 15:1062,522528,863,415461,683,00057,252,0002,113,536
4Sep 7, 2026 15:1062,551529,179,051461,452,00057,722,0002,113,536
5Sep 7, 2026 15:1062,583529,611,035461,026,00058,420,0002,113,536
6Sep 7, 2026 15:1062,607529,591,947461,559,00058,081,0002,113,536
7Sep 7, 2026 15:1062,625530,239,853461,576,00058,214,0002,113,536
8Sep 7, 2026 15:1062,708530,440,376461,393,00059,085,0002,113,536
9Sep 7, 2026 15:1062,719530,632,089461,447,00059,123,0002,113,536