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 25, 2025 14:36VladislavVladislavScore: 60,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2025 14:3660,051525,355,986497,423,0001,000,0002,269,184
2Aug 25, 2025 14:3660,067528,009,080496,556,0001,998,0002,281,472
3Aug 25, 2025 14:3660,070529,717,106495,584,0002,997,0002,404,352
4Aug 25, 2025 14:3660,075524,429,057494,629,0003,997,0002,392,064
5Aug 25, 2025 14:3660,077524,952,065496,644,0001,998,0002,404,352
6Aug 25, 2025 14:3660,077525,856,403496,644,0001,998,0002,269,184
7Aug 25, 2025 14:3660,078522,254,828496,649,0001,998,0002,400,256
8Aug 25, 2025 14:3660,085520,147,635495,710,0002,998,0002,269,184
9Aug 25, 2025 14:3660,095518,120,216497,790,000999,0002,396,160