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 listAug 11, 2025 17:05Ian MckibbenIan MckibbenScore: 14,152Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2025 17:0514,137141,326,359117,335,00002,433,024
2Aug 11, 2025 17:0514,145140,167,624117,405,00002,269,184
3Aug 11, 2025 17:0514,146144,682,473117,408,00002,433,024
4Aug 11, 2025 17:0514,146141,213,533117,415,00002,433,024
5Aug 11, 2025 17:0514,152137,956,665117,460,00002,424,832
6Aug 11, 2025 17:0514,154144,641,725116,475,0001,004,0002,420,736
7Aug 11, 2025 17:0514,154135,858,862117,481,00002,424,832
8Aug 11, 2025 17:0514,157136,192,948117,504,00002,531,328
9Aug 11, 2025 17:0514,158145,767,609116,511,0001,004,0002,531,328