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 listMar 18, 2026 10:42wnwnScore: 4,298Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 10:424,23555,653,03733,143,0002,008,0002,273,280
2Mar 18, 2026 10:424,26055,377,28334,346,0001,010,0002,490,368
3Mar 18, 2026 10:424,26458,056,49134,381,0001,011,0002,494,464
4Mar 18, 2026 10:424,28560,628,07434,550,0001,016,0002,494,464
5Mar 18, 2026 10:424,28963,928,78334,584,0001,017,0002,273,280
6Mar 18, 2026 10:424,29663,952,95434,636,0001,018,0002,490,368
7Mar 18, 2026 10:424,29863,802,24634,656,0001,019,0002,273,280
8Mar 18, 2026 10:424,31760,204,20434,839,000995,0002,273,280
9Mar 18, 2026 10:424,32454,874,00333,893,0001,993,0002,498,560
10Mar 18, 2026 10:424,33558,555,77533,984,0001,999,0002,498,560
11Mar 18, 2026 10:424,64562,676,75937,539,0001,014,0002,494,464
12Mar 18, 2026 10:424,67863,465,95536,833,0001,991,0002,498,560