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 listSep 19, 2025 15:34limanjun99limanjun99Score: 22,571Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 19, 2025 15:3422,286207,981,755182,978,0001,999,0002,277,376
2Sep 19, 2025 15:3422,362215,820,943181,610,0003,991,0002,523,136
3Sep 19, 2025 15:3422,553209,694,280185,190,0002,002,0002,269,184
4Sep 19, 2025 15:3422,561213,724,378184,254,0003,004,0002,273,280
5Sep 19, 2025 15:3422,571214,283,910184,352,0002,989,0002,531,328
6Sep 19, 2025 15:3422,571208,545,193186,339,0001,001,0002,273,280
7Sep 19, 2025 15:3422,573214,969,343186,358,0001,001,0002,269,184
8Sep 19, 2025 15:3422,581209,040,390185,420,0002,004,0002,260,992
9Sep 19, 2025 15:3422,581213,636,257185,417,0002,004,0002,277,376