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 27, 2025 06:44SinaSinaScore: 458,235Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 06:44457,7753,825,972,5013,734,576,00064,957,0002,285,568
2Sep 27, 2025 06:44458,0393,831,132,0303,737,763,00063,961,0002,285,568
3Sep 27, 2025 06:44458,0413,835,297,6063,735,777,00065,960,0002,519,040
4Sep 27, 2025 06:44458,1633,831,256,2583,738,791,00063,962,0002,277,376
5Sep 27, 2025 06:44458,2353,826,661,3653,730,403,00072,949,0002,277,376
6Sep 27, 2025 06:44458,2613,831,754,7543,742,609,00060,961,0002,510,848
7Sep 27, 2025 06:44458,4303,827,763,1143,743,005,00061,966,0002,260,992
8Sep 27, 2025 06:44461,8183,859,298,1463,763,126,00069,965,0002,285,568
9Sep 27, 2025 06:44465,1833,886,718,6273,802,048,00058,969,0002,285,568