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 listMay 19, 2025 22:17T PrathamT PrathamScore: 34,860Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 22:1734,837310,534,901288,149,0001,000,0002,273,280
2May 19, 2025 22:1734,856309,889,743288,302,0001,001,0002,396,160
3May 19, 2025 22:1734,858318,114,151288,323,0001,001,0002,289,664
4May 19, 2025 22:1734,859308,936,139288,326,0001,001,0002,396,160
5May 19, 2025 22:1734,860310,295,907289,337,00002,265,088
6May 19, 2025 22:1734,860308,724,294288,336,0001,001,0002,289,664
7May 19, 2025 22:1734,860311,531,429288,340,0001,001,0002,289,664
8May 19, 2025 22:1734,860319,679,284288,340,0001,001,0002,289,664
9May 19, 2025 22:1734,866315,655,194288,384,0001,001,0002,289,664