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 16, 2026 18:12marko1597marko1597Score: 4,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 18:344,57146,139,34536,909,0001,032,0002,117,632
2Aug 16, 2026 18:344,57646,438,81436,874,0001,109,0002,117,632
3Aug 16, 2026 18:344,59946,487,53237,062,0001,116,0002,117,632
4Aug 16, 2026 18:344,61046,581,00437,157,0001,110,0002,117,632
5Aug 16, 2026 18:344,63846,757,88437,356,0001,144,0002,117,632
6Aug 16, 2026 18:344,64148,078,34837,403,0001,123,0002,117,632
7Aug 16, 2026 18:344,77049,212,12238,510,0001,088,0002,117,632
8Aug 16, 2026 18:346,24560,095,89850,772,0001,062,0002,117,632
9Aug 16, 2026 18:346,43361,751,23852,280,0001,117,0002,117,632