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 11, 2026 22:54Victor MerckléVictor MerckléScore: 4,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 22:553,98241,459,71932,011,0001,046,0002,117,632stderr
2Aug 11, 2026 22:553,98641,544,73931,948,0001,141,0002,117,632stderr
3Aug 11, 2026 22:553,99142,919,45831,999,0001,129,0002,117,632stderr
4Aug 11, 2026 22:553,99141,644,66332,086,0001,043,0002,117,632stderr
5Aug 11, 2026 22:554,00041,614,87332,155,0001,048,0002,117,632stderr
6Aug 11, 2026 22:554,00441,631,51232,195,0001,039,0002,117,632stderr
7Aug 11, 2026 22:554,02641,823,56632,263,0001,153,0002,117,632stderr
8Aug 11, 2026 22:554,16742,969,00533,539,0001,048,0002,117,632stderr
9Aug 11, 2026 22:554,22343,471,86533,997,0001,054,0002,117,632stderr