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 2, 2026 18:30CheckHarryCheckHarryScore: 6,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 18:306,07060,228,70249,197,0001,188,0002,113,536
2Sep 2, 2026 18:306,08060,399,55949,419,0001,052,0002,113,536
3Sep 2, 2026 18:306,08360,363,87449,327,0001,170,0002,113,536
4Sep 2, 2026 18:306,08660,500,05949,453,0001,065,0002,113,536
5Sep 2, 2026 18:306,08960,363,60649,497,0001,043,0002,113,536
6Sep 2, 2026 18:306,09160,511,75449,388,0001,168,0002,113,536
7Sep 2, 2026 18:306,09160,351,76949,392,0001,170,0002,113,536
8Sep 2, 2026 18:306,09460,410,76349,547,0001,040,0002,113,536
9Sep 2, 2026 18:306,10778,633,05049,574,0001,115,0002,117,632