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 30, 2026 19:41Josu San MartinJosu San MartinScore: 4,307Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:414,29144,043,08034,585,0001,035,0002,113,536
2Aug 30, 2026 19:414,29844,070,01534,643,0001,035,0002,113,536
3Aug 30, 2026 19:414,30344,130,63634,692,0001,028,0002,113,536
4Aug 30, 2026 19:414,30444,277,24434,669,0001,057,0002,113,536
5Aug 30, 2026 19:414,30744,166,04734,726,0001,029,0002,113,536
6Aug 30, 2026 19:414,30844,175,23634,711,0001,050,0002,113,536
7Aug 30, 2026 19:414,31944,270,17334,779,0001,070,0002,113,536
8Aug 30, 2026 19:414,33045,933,24834,850,0001,097,0002,113,536
9Aug 30, 2026 19:414,35844,615,65235,042,0001,132,0002,113,536