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 23:08Victor MerckléVictor MerckléScore: 3,759Success
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 23:093,74339,644,52429,958,0001,111,0002,117,632stderr
2Aug 12, 2026 23:093,75039,603,84929,981,0001,147,0002,117,632stderr
3Aug 12, 2026 23:093,75439,312,45830,084,0001,075,0002,117,632stderr
4Aug 12, 2026 23:093,75539,609,47330,025,0001,149,0002,117,632stderr
5Aug 12, 2026 23:093,75939,646,05230,107,0001,097,0002,117,632stderr
6Aug 12, 2026 23:093,79039,908,88830,265,0001,193,0002,117,632stderr
7Aug 12, 2026 23:093,82641,254,69030,626,0001,133,0002,117,632stderr
8Aug 12, 2026 23:093,86940,553,57730,869,0001,251,0002,117,632stderr
9Aug 12, 2026 23:093,98041,507,21331,967,0001,073,0002,117,632stderr