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 9, 2026 14:45Victor MerckléVictor MerckléScore: 46,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 14:4846,491394,668,991384,229,0001,647,00024,576stderr
2Sep 9, 2026 14:4846,560395,783,356383,185,0003,263,0002,117,632stderr
3Sep 9, 2026 14:4846,573395,778,990384,906,0001,650,00024,576stderr
4Sep 9, 2026 14:4846,607396,151,658383,398,0003,445,0002,117,632stderr
5Sep 9, 2026 14:4846,609395,522,834383,841,0003,019,0002,117,632stderr
6Sep 9, 2026 14:4846,717397,043,601386,025,0001,731,00024,576stderr
7Sep 9, 2026 14:4846,723396,511,755384,156,0003,651,0002,117,632stderr
8Sep 9, 2026 14:4846,819397,833,395385,086,0003,514,0002,117,632stderr
9Sep 9, 2026 14:4846,849397,494,366385,386,0003,467,0002,117,632stderr