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 listMay 19, 2025 14:26Rachel TanRachel TanScore: 368,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 14:26366,2523,072,154,3582,983,913,00055,979,0002,367,488
2May 19, 2025 14:26367,3743,077,030,4922,984,244,00064,961,0002,285,568
3May 19, 2025 14:26368,1933,085,021,7393,002,039,00053,964,0002,281,472
4May 19, 2025 14:26368,3503,084,496,7893,000,341,00056,968,0002,281,472
5May 19, 2025 14:26368,6403,086,260,9373,002,738,00056,976,0002,285,568
6May 19, 2025 14:26368,8353,087,523,1773,001,366,00059,967,0002,285,568
7May 19, 2025 14:26369,0313,086,953,4772,980,989,00081,972,0002,289,664
8May 19, 2025 14:26371,3643,110,084,9743,013,357,00068,962,0002,281,472
9May 19, 2025 14:26371,7053,115,653,2463,024,167,00060,983,0002,285,568