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 listOct 5, 2026 06:51Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 06:51012,628,79502,501,0002,121,728expected "53688546787422356 ", got "pop 278us pmd 509952 rss 511852 n 524135504 /mnt/hldata/data1666579982 "
2Oct 5, 2026 06:51012,592,36202,510,0002,121,728expected "53686593029089402 ", got "pop 272us pmd 509952 rss 511844 n 524126792 /mnt/hldata/data21882201 "
3Oct 5, 2026 06:51012,647,34402,509,0002,121,728expected "53681718439795529 ", got "pop 270us pmd 509952 rss 511844 n 524125976 /mnt/hldata/data2979691398 "