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 listApr 19, 2025 16:07Aleksey ShvetsAleksey ShvetsScore: 264,831Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 19, 2025 16:07264,6692,224,124,3632,097,808,00098,943,0002,469,888
2Apr 19, 2025 16:07264,6992,224,606,2772,098,046,00098,955,0002,465,792
3Apr 19, 2025 16:07264,7222,222,204,9362,087,231,000109,959,0002,322,432
4Apr 19, 2025 16:07264,7632,225,250,4112,102,556,00094,979,0002,322,432
5Apr 19, 2025 16:07264,8312,225,329,6932,096,184,000101,911,0002,469,888
6Apr 19, 2025 16:07264,9232,227,254,4322,095,916,000102,946,0002,326,528
7Apr 19, 2025 16:07264,9602,226,327,9932,103,247,00095,920,0002,326,528
8Apr 19, 2025 16:07264,9692,226,626,7322,099,274,00099,965,0002,322,432
9Apr 19, 2025 16:07266,6712,249,327,0082,119,394,00093,973,0002,326,528