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 listJun 22, 2026 10:58Omkar SinghOmkar SinghScore: 142,737Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 10:59142,5051,192,792,5941,118,458,00064,336,0002,113,536
2Jun 22, 2026 10:59142,5391,192,138,1221,119,976,00063,101,0002,113,536
3Jun 22, 2026 10:59142,6371,193,015,3701,119,788,00064,100,0002,113,536
4Jun 22, 2026 10:59142,6851,195,330,6861,120,209,00064,078,0002,113,536
5Jun 22, 2026 10:59142,7371,194,143,3261,120,635,00064,090,0002,113,536
6Jun 22, 2026 10:59142,7731,194,217,9581,119,862,00065,159,0002,113,536
7Jun 22, 2026 10:59142,7971,194,651,7961,120,953,00064,268,0002,113,536
8Jun 22, 2026 10:59143,0681,196,673,5081,122,162,00065,305,0002,113,536
9Jun 22, 2026 10:59150,2101,255,962,7741,183,665,00063,086,0002,113,536