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 25, 2026 15:27Dominique GarmierDominique GarmierScore: 275,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 15:22275,2162,306,877,2552,283,295,000999,0002,482,176
2Mar 25, 2026 15:27275,2922,309,244,0212,283,926,000999,0002,277,376
3Mar 25, 2026 15:22275,3112,305,717,1462,284,080,000999,0002,273,280
4Mar 25, 2026 15:27275,3302,307,144,2032,283,238,0001,998,0002,531,328
5Mar 25, 2026 15:27275,3472,313,544,5392,284,382,000999,0002,277,376
6Mar 25, 2026 15:22275,3622,316,709,2552,284,504,000999,0002,277,376