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 13, 2026 18:24Victor MerckléVictor MerckléScore: 69,889Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:2469,783586,476,119578,167,0001,033,0002,117,632stderr
2May 13, 2026 18:2469,816587,369,559578,350,0001,131,0002,117,632stderr
3May 13, 2026 18:2469,824589,277,474578,480,0001,064,0002,117,632stderr
4May 13, 2026 18:2469,875589,471,942578,820,0001,145,0002,117,632stderr
5May 13, 2026 18:2469,889589,802,631578,968,0001,114,0002,117,632stderr
6May 13, 2026 18:2470,061592,713,839580,464,0001,045,0002,117,632stderr
7May 13, 2026 18:2470,278602,217,797582,314,0001,001,0002,117,632stderr
8May 13, 2026 18:2470,443592,133,758583,567,0001,114,0002,117,632stderr
9May 13, 2026 18:2470,685594,479,937585,542,0001,150,0002,117,632stderr