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 16, 2026 03:08Victor MerckléVictor MerckléScore: 61,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 03:0961,316516,259,192507,857,0001,066,0002,117,632stderr
2May 16, 2026 03:0961,321517,173,012507,834,0001,134,0002,117,632stderr
3May 16, 2026 03:0961,322518,100,433507,852,0001,121,0002,117,632stderr
4May 16, 2026 03:0961,330516,346,820507,909,0001,134,0002,117,632stderr
5May 16, 2026 03:0961,331520,544,951507,908,0001,143,0002,117,632stderr
6May 16, 2026 03:0961,353517,018,414508,083,0001,152,0002,117,632stderr
7May 16, 2026 03:0961,652519,275,753510,596,0001,119,0002,117,632stderr
8May 16, 2026 03:0961,855522,917,730512,395,0001,008,0002,117,632stderr
9May 16, 2026 03:0961,895523,531,325512,706,0001,030,0002,117,632stderr