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 26, 2026 04:02Victor MerckléVictor MerckléScore: 4,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 04:024,14342,787,55633,266,0001,123,0002,117,632stderr
2Aug 26, 2026 04:024,25543,660,45034,219,0001,102,0002,117,632stderr
3Aug 26, 2026 04:024,27543,817,13834,444,0001,042,0002,117,632stderr
4Aug 26, 2026 04:024,27643,886,06834,443,0001,050,0002,117,632stderr
5Aug 26, 2026 04:024,27743,854,25534,483,0001,024,0002,117,632stderr
6Aug 26, 2026 04:024,28143,958,55634,386,0001,147,0002,117,632stderr
7Aug 26, 2026 04:024,28443,909,92634,495,0001,068,0002,117,632stderr
8Aug 26, 2026 04:024,28943,978,06634,540,0001,059,0002,117,632stderr
9Aug 26, 2026 04:024,29443,995,21134,591,0001,050,0002,117,632stderr