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 19, 2026 00:11Omkar SinghOmkar SinghScore: 507,061Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 00:12502,8544,183,067,2614,107,614,00066,075,0002,113,536
2Jun 19, 2026 00:12503,2454,186,420,6544,111,889,00065,052,0002,113,536
3Jun 19, 2026 00:12503,3404,187,251,8544,113,576,00064,150,0002,113,536
4Jun 19, 2026 00:12503,7974,191,069,1664,117,233,00064,284,0002,113,536
5Jun 19, 2026 00:12507,0614,218,359,0394,145,567,00063,046,0002,113,536
6Jun 19, 2026 00:12507,2234,220,894,4864,145,643,00064,309,0002,113,536
7Jun 19, 2026 00:12507,3884,220,701,9384,146,201,00065,125,0002,113,536
8Jun 19, 2026 00:12507,5214,221,812,5894,147,347,00065,081,0002,113,536
9Jun 19, 2026 00:12509,9664,242,608,0664,167,665,00065,053,0002,113,536