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 17, 2026 19:46flavio87flavio87Score: 4,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 19:484,01441,476,33132,311,0001,011,0002,113,536
2Aug 17, 2026 19:484,01541,646,39332,296,0001,033,0002,113,536
3Aug 17, 2026 19:484,01741,721,66132,309,0001,038,0002,113,536
4Aug 17, 2026 19:484,01841,792,32932,352,0001,005,0002,113,536
5Aug 17, 2026 19:484,01941,687,03932,318,0001,040,0002,113,536
6Aug 17, 2026 19:484,04341,921,22832,557,0001,004,0002,113,536
7Aug 17, 2026 19:484,04641,696,58832,554,0001,036,0002,113,536
8Aug 17, 2026 19:484,11743,242,52633,106,0001,073,0002,113,536
9Aug 17, 2026 19:484,13042,651,61833,211,0001,070,0002,113,536