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 listFeb 15, 2026 23:04wnwnScore: 9,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:047,95391,553,85560,008,0006,000,0002,338,816
2Feb 15, 2026 23:048,04791,702,94155,824,00010,965,0002,396,160
3Feb 15, 2026 23:048,17092,222,24159,832,0007,977,0002,285,568
4Feb 15, 2026 23:049,233104,678,16268,571,0008,067,0002,478,080
5Feb 15, 2026 23:049,349104,164,11968,524,0009,069,0002,461,696
6Feb 15, 2026 23:049,369103,805,28669,785,0007,975,0002,375,680