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 listAug 3, 2026 16:36Teow Hua JunTeow Hua JunScore: 8,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 16:378,51380,481,77369,653,0001,012,0002,113,536
2Aug 3, 2026 16:378,51580,614,48369,397,0001,279,0002,113,536
3Aug 3, 2026 16:378,51880,554,64469,691,0001,009,0002,113,536
4Aug 3, 2026 16:378,51980,539,90769,447,0001,267,0002,113,536
5Aug 3, 2026 16:378,51980,586,73069,707,0001,008,0002,113,536
6Aug 3, 2026 16:378,52080,607,00869,449,0001,273,0002,113,536
7Aug 3, 2026 16:378,52380,556,45669,473,0001,276,0002,113,536
8Aug 3, 2026 16:378,52580,658,01369,749,0001,009,0002,113,536
9Aug 3, 2026 16:378,53380,694,99169,815,0001,013,0002,113,536