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 07:10Victor MerckléVictor MerckléScore: 3,888Success
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 07:103,83640,356,19430,712,0001,128,0002,117,632stderr
2Aug 12, 2026 07:103,83940,998,59530,688,0001,183,0002,117,632stderr
3Aug 12, 2026 07:103,86040,388,18430,957,0001,086,0002,117,632stderr
4Aug 12, 2026 07:103,86640,267,42730,978,0001,116,0002,117,632stderr
5Aug 12, 2026 07:103,88840,512,96431,178,0001,100,0002,117,632stderr
6Aug 12, 2026 07:103,90940,756,97331,374,0001,075,0002,117,632stderr
7Aug 12, 2026 07:103,95641,143,10431,758,0001,077,0002,117,632stderr
8Aug 12, 2026 07:104,13043,363,47533,231,0001,056,0002,117,632stderr
9Aug 12, 2026 07:104,13543,423,76933,270,0001,052,0002,117,632stderr