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 24, 2026 20:30Victor MerckléVictor MerckléScore: 3,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:313,92941,036,56131,449,0001,164,0002,117,632stderr
2Aug 24, 2026 20:313,93041,302,72131,476,0001,144,0002,117,632stderr
3Aug 24, 2026 20:313,93341,008,91731,521,0001,127,0002,117,632stderr
4Aug 24, 2026 20:313,93941,088,42431,531,0001,170,0002,117,632stderr
5Aug 24, 2026 20:313,94541,134,65631,653,0001,094,0002,117,632stderr
6Aug 24, 2026 20:313,95141,391,90331,633,0001,165,0002,117,632stderr
7Aug 24, 2026 20:313,98041,443,40131,931,0001,107,0002,117,632stderr
8Aug 24, 2026 20:313,98441,530,35832,051,0001,022,0002,117,632stderr
9Aug 24, 2026 20:314,02741,814,57432,352,0001,074,0002,117,632stderr