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 listDec 29, 2025 10:53Aman | अमनAman | अमनScore: 54,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 10:5354,776486,247,308453,645,000999,0002,510,848
2Dec 29, 2025 10:5354,825480,008,596453,047,0002,000,0002,510,848
3Dec 29, 2025 10:5354,832484,293,431453,103,0002,000,0002,519,040
4Dec 29, 2025 10:5354,840478,218,843453,169,0002,000,0002,387,968
5Dec 29, 2025 10:5354,853475,770,833454,283,0001,000,0002,396,160
6Dec 29, 2025 10:5354,869487,546,319454,412,0001,000,0002,519,040
7Dec 29, 2025 10:5354,908482,454,129453,740,0001,998,0002,510,848
8Dec 29, 2025 10:5354,921486,083,319453,842,0001,999,0002,510,848
9Dec 29, 2025 10:5354,955482,435,237455,123,0001,000,0002,519,040