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 listJun 5, 2025 13:17limanjun99limanjun99Score: 75,059Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 5, 2025 13:1774,895647,331,301554,666,00066,959,0002,379,776
2Jun 5, 2025 13:1774,900644,835,375571,695,00049,973,0002,269,184
3Jun 5, 2025 13:1775,010651,874,887565,533,00057,053,0002,269,184
4Jun 5, 2025 13:1775,021648,714,198558,707,00063,966,0002,269,184
5Jun 5, 2025 13:1775,059645,375,723575,993,00046,999,0002,502,656
6Jun 5, 2025 13:1775,085645,733,878550,182,00073,024,0002,375,680
7Jun 5, 2025 13:1775,138646,752,074553,685,00069,960,0002,269,184
8Jun 5, 2025 13:1775,196646,672,378558,114,00066,013,0002,379,776
9Jun 5, 2025 13:1775,201644,902,619560,152,00064,017,0002,383,872