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 26, 2025 19:19sheryllynn24sheryllynn24Score: 6,368Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 19:196,33475,597,64352,572,00002,285,568
2Sep 26, 2025 19:196,33979,683,85552,614,00002,285,568
3Sep 26, 2025 19:196,34278,630,55351,623,0001,012,0002,269,184
4Sep 26, 2025 19:196,34779,489,82552,684,00002,260,992
5Sep 26, 2025 19:196,35082,561,70251,692,0001,013,0002,285,568
6Sep 26, 2025 19:196,36485,911,66950,825,0001,993,0002,260,992
7Sep 26, 2025 19:196,36886,115,37850,860,0001,994,0002,285,568
8Sep 26, 2025 19:196,36884,638,24851,854,000997,0002,510,848
9Sep 26, 2025 19:196,41882,626,97351,262,0002,010,0002,285,568
10Sep 26, 2025 19:196,46080,796,25853,617,00002,265,088
11Sep 26, 2025 19:196,49080,916,17052,868,000997,0002,285,568
12Sep 26, 2025 19:196,49578,038,62551,909,0001,996,0002,265,088