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:59Victor MerckléVictor MerckléScore: 9,231Success
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 08:009,19284,704,89275,274,0001,020,0002,117,632stderr
2Aug 12, 2026 08:009,20984,839,16275,421,0001,020,0002,117,632stderr
3Aug 12, 2026 08:009,21884,938,29375,496,0001,018,0002,117,632stderr
4Aug 12, 2026 08:009,22684,981,65575,481,0001,095,0002,117,632stderr
5Aug 12, 2026 08:009,23185,004,45875,594,0001,025,0002,117,632stderr
6Aug 12, 2026 08:009,23785,086,83675,663,0001,011,0002,117,632stderr
7Aug 12, 2026 08:009,25185,147,78875,705,0001,080,0002,117,632stderr
8Aug 12, 2026 08:009,31785,858,85976,212,0001,127,0002,117,632stderr
9Aug 12, 2026 08:009,32385,771,84376,355,0001,033,0002,117,632stderr