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 listAug 25, 2026 02:29Victor MerckléVictor MerckléScore: 7,407Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 02:307,36769,592,39660,034,0001,116,0002,117,632stderr
2Aug 25, 2026 02:307,38069,678,39660,052,0001,210,0002,117,632stderr
3Aug 25, 2026 02:307,38169,604,56060,122,0001,141,0002,117,632stderr
4Aug 25, 2026 02:307,38769,602,23760,177,0001,137,0002,117,632stderr
5Aug 25, 2026 02:307,40769,860,66960,374,0001,109,0002,117,632stderr
6Aug 25, 2026 02:307,41569,933,34460,348,0001,199,0002,117,632stderr
7Aug 25, 2026 02:307,43670,086,57060,627,0001,095,0002,117,632stderr
8Aug 25, 2026 02:307,43970,132,44460,591,0001,153,0002,117,632stderr
9Aug 25, 2026 02:307,60071,532,20961,946,0001,141,0002,117,632stderr