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 12, 2026 13:10Victor MerckléVictor MerckléScore: 3,915Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 13:103,89040,872,61031,004,0001,284,0002,117,632stderr
2Aug 12, 2026 13:103,89640,735,79531,218,0001,125,0002,117,632stderr
3Aug 12, 2026 13:103,89840,761,88431,269,0001,090,0002,117,632stderr
4Aug 12, 2026 13:103,90840,839,32231,347,0001,092,0002,117,632stderr
5Aug 12, 2026 13:103,91540,889,33531,416,0001,083,0002,117,632stderr
6Aug 12, 2026 13:103,91740,975,60031,419,0001,095,0002,117,632stderr
7Aug 12, 2026 13:104,09742,422,81632,956,0001,050,0002,117,632stderr
8Aug 12, 2026 13:104,11642,586,78733,058,0001,112,0002,117,632stderr
9Aug 12, 2026 13:104,15542,893,99533,409,0001,084,0002,117,632stderr