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 29, 2026 16:33parastromparastromScore: 4,291Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 22:30Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 16:354,20245,419,01833,828,0001,050,0002,113,536
2Sep 29, 2026 16:354,21345,473,12033,925,0001,051,0002,113,536
3Sep 29, 2026 16:354,22245,428,02733,894,0001,152,0002,113,536
4Sep 29, 2026 16:354,27345,870,08134,385,0001,083,0002,113,536
5Sep 29, 2026 16:354,29146,029,79534,430,0001,188,0002,113,536
6Sep 29, 2026 16:354,29246,259,45434,584,0001,047,0002,113,536
7Sep 29, 2026 16:354,30446,238,27034,606,0001,118,0002,113,536
8Sep 29, 2026 16:354,32146,353,00734,729,0001,142,0002,113,536
9Sep 29, 2026 16:354,32946,417,92334,777,0001,160,0002,113,536