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 listOct 29, 2025 16:31Max LyuchinMax LyuchinScore: 273,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 16:31273,3082,294,007,6462,168,526,00099,932,0002,326,528
2Oct 29, 2025 16:31273,3202,289,843,5212,169,623,00098,937,0002,326,528
3Oct 29, 2025 16:31273,3252,295,895,6652,180,654,00087,945,0002,433,024
4Oct 29, 2025 16:31273,3472,297,164,7852,149,847,000118,936,0002,326,528
5Oct 29, 2025 16:31273,3502,293,453,1342,187,846,00080,957,0002,326,528
6Oct 29, 2025 16:31273,4622,295,511,9742,182,785,00086,951,0002,326,528
7Oct 29, 2025 16:31273,5972,295,839,5432,156,916,000113,942,0002,326,528
8Oct 29, 2025 16:31273,9322,298,126,3872,177,690,00095,942,0002,326,528
9Oct 29, 2025 16:31275,3362,314,200,1862,190,362,00094,929,0002,326,528