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 22:27Victor MerckléVictor MerckléScore: 5,182Success
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 22:285,02550,179,17140,601,0001,110,0002,117,632stderr
2Aug 24, 2026 22:285,03750,183,43640,707,0001,101,0002,117,632stderr
3Aug 24, 2026 22:285,07450,251,34540,911,0001,209,0002,117,632stderr
4Aug 24, 2026 22:285,14150,849,89941,594,0001,079,0002,117,632stderr
5Aug 24, 2026 22:285,18252,719,49341,930,0001,085,0002,117,632stderr
6Aug 24, 2026 22:285,29052,336,51142,738,0001,176,0002,117,632stderr
7Aug 24, 2026 22:285,30752,304,85842,902,0001,149,0002,117,632stderr
8Aug 24, 2026 22:285,37052,753,35443,458,0001,113,0002,117,632stderr
9Aug 24, 2026 22:285,41853,185,23543,904,0001,067,0002,117,632stderr