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 24, 2026 19:30Victor MerckléVictor MerckléScore: 3,855Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:313,73839,426,57029,909,0001,120,0002,117,632stderr
2Aug 24, 2026 19:313,74439,530,39429,889,0001,194,0002,117,632stderr
3Aug 24, 2026 19:313,77940,176,04530,249,0001,121,0002,117,632stderr
4Aug 24, 2026 19:313,81440,038,33930,511,0001,153,0002,117,632stderr
5Aug 24, 2026 19:313,85540,376,04530,927,0001,073,0002,117,632stderr
6Aug 24, 2026 19:313,87540,500,29231,077,0001,090,0002,117,632stderr
7Aug 24, 2026 19:313,92740,969,37531,458,0001,141,0002,117,632stderr
8Aug 24, 2026 19:314,02141,743,17332,308,0001,068,0002,117,632stderr
9Aug 24, 2026 19:314,03741,849,54432,443,0001,071,0002,117,632stderr