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 listSep 30, 2026 18:15Karthik ReddyKarthik ReddyScore: 3,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 18:153,41237,303,25927,245,0001,082,0002,113,536
2Sep 30, 2026 18:153,41537,062,02627,195,0001,156,0002,113,536
3Sep 30, 2026 18:153,42037,301,38227,266,0001,128,0002,113,536
4Sep 30, 2026 18:153,42137,348,72427,301,0001,101,0002,113,536
5Sep 30, 2026 18:153,42237,172,61127,287,0001,122,0002,113,536
6Sep 30, 2026 18:153,42237,901,18827,298,0001,108,0002,113,536
7Sep 30, 2026 18:153,45837,618,87927,519,0001,185,0002,113,536
8Sep 30, 2026 18:153,45837,687,82327,531,0001,178,0002,113,536
9Sep 30, 2026 18:153,46137,756,46527,711,0001,022,0002,113,536