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 13, 2026 05:28e1011e1011Score: 57,896Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2026 05:2857,863491,206,912421,295,00058,971,0002,113,536
2Oct 13, 2026 05:2857,873491,659,912421,320,00059,028,0002,113,536
3Oct 13, 2026 05:2857,891491,692,707421,839,00058,660,0002,113,536
4Oct 13, 2026 05:2857,895491,179,813421,907,00058,627,0002,113,536
5Oct 13, 2026 05:2857,896491,844,338421,892,00058,653,0002,113,536
6Oct 13, 2026 05:2857,936491,387,151421,390,00059,481,0002,113,536
7Oct 13, 2026 05:2857,939491,506,352421,773,00059,122,0002,113,536
8Oct 13, 2026 05:2857,953491,494,768421,868,00059,146,0002,113,536
9Oct 13, 2026 05:2857,969491,937,696421,936,00059,210,0002,113,536