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 13:20marko1597marko1597Score: 5,495Success
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 13:505,46756,145,67144,235,0001,149,0002,113,536
2Aug 16, 2026 13:505,47456,198,17744,261,0001,174,0002,113,536
3Aug 16, 2026 13:505,47855,470,87244,321,0001,151,0002,113,536
4Aug 16, 2026 13:505,48055,455,01244,323,0001,161,0002,113,536
5Aug 16, 2026 13:505,49556,414,17144,441,0001,171,0002,113,536
6Aug 16, 2026 13:505,62157,396,64145,509,0001,150,0002,113,536
7Aug 16, 2026 13:505,64557,631,74845,701,0001,154,0002,113,536
8Aug 16, 2026 13:505,65457,744,99945,780,0001,152,0002,113,536
9Aug 16, 2026 13:505,65657,789,69545,765,0001,183,0002,113,536