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 listMay 10, 2026 11:20wnwnScore: 3,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 11:203,48146,299,49827,846,0001,049,0002,486,272
2May 10, 2026 11:203,48847,990,49127,716,0001,238,0002,490,368
3May 10, 2026 11:203,50045,705,94628,011,0001,042,0002,482,176
4May 10, 2026 11:203,50245,104,28228,032,0001,040,0002,486,272
5May 10, 2026 11:203,61944,681,12729,005,0001,040,0002,482,176
6May 10, 2026 11:203,66946,876,37529,419,0001,040,0002,486,272
7May 10, 2026 11:203,68346,437,77829,532,0001,040,0002,486,272
8May 10, 2026 11:203,69042,966,85629,584,0001,050,0002,486,272
9May 10, 2026 11:203,69345,732,84729,615,0001,041,0002,486,272