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 29, 2026 17:36Victor MerckléVictor MerckléScore: 3,680Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 17:373,65538,793,18529,174,0001,167,0002,117,632stderr
2Aug 29, 2026 17:373,65638,678,65529,217,0001,129,0002,117,632stderr
3Aug 29, 2026 17:373,66038,805,14629,236,0001,150,0002,117,632stderr
4Aug 29, 2026 17:373,67040,065,42729,343,0001,122,0002,117,632stderr
5Aug 29, 2026 17:373,68039,590,86329,406,0001,145,0002,117,632stderr
6Aug 29, 2026 17:373,68738,913,26729,477,0001,127,0002,117,632stderr
7Aug 29, 2026 17:373,71139,094,47429,742,0001,061,0002,117,632stderr
8Aug 29, 2026 17:373,71441,142,69329,681,0001,152,0002,117,632stderr
9Aug 29, 2026 17:373,74940,210,05129,995,0001,123,0002,117,632stderr