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 27, 2026 01:33Victor MerckléVictor MerckléScore: 4,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 01:344,36644,521,92035,164,0001,078,0002,117,632stderr
2Aug 27, 2026 01:344,47345,688,07535,927,0001,199,0002,117,632stderr
3Aug 27, 2026 01:344,48345,553,12636,121,0001,094,0002,117,632stderr
4Aug 27, 2026 01:344,53145,951,81136,479,0001,131,0002,117,632stderr
5Aug 27, 2026 01:344,53345,901,53036,545,0001,082,0002,117,632stderr
6Aug 27, 2026 01:344,60446,724,67337,105,0001,115,0002,117,632stderr
7Aug 27, 2026 01:344,61347,229,33037,206,0001,087,0002,117,632stderr
8Aug 27, 2026 01:344,63546,771,62537,260,0001,213,0002,117,632stderr
9Aug 27, 2026 01:344,63947,477,79037,414,0001,090,0002,117,632stderr