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 5, 2026 13:31Mohamed Elmahdi BendimeradMohamed Elmahdi BendimeradScore: 92,633Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 13:3192,591785,529,135705,976,00062,533,0002,359,296
2May 5, 2026 13:3192,607786,785,078706,266,00062,375,0002,363,392
3May 5, 2026 13:3192,608785,759,437705,726,00062,927,0002,342,912
4May 5, 2026 13:3192,627786,958,226706,382,00062,425,0002,347,008
5May 5, 2026 13:3192,633788,893,176706,128,00062,726,0002,363,392
6May 5, 2026 13:3192,633787,370,558705,898,00062,963,0002,351,104
7May 5, 2026 13:3192,642785,667,380706,228,00062,704,0002,342,912
8May 5, 2026 13:3192,734786,943,460706,488,00063,206,0002,359,296
9May 5, 2026 13:3192,767786,766,066706,289,00063,685,0002,342,912