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 listMay 25, 2026 16:14Kenzie_RTKenzie_RTScore: 106,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2026 16:14106,405893,033,225789,021,00094,144,0002,113,536
2May 25, 2026 16:14106,496896,099,956789,548,00094,372,0002,113,536
3May 25, 2026 16:14106,508893,357,893789,946,00094,073,0002,113,536
4May 25, 2026 16:14106,747896,267,988789,428,00096,576,0002,113,536
5May 25, 2026 16:14106,821897,327,319789,793,00096,828,0002,113,536
6May 25, 2026 16:14107,108898,471,581790,665,00098,335,0002,113,536
7May 25, 2026 16:14107,335902,285,536790,418,000100,470,0002,113,536
8May 25, 2026 16:14107,456902,246,294790,828,000101,064,0002,113,536
9May 25, 2026 16:14107,465903,165,464790,510,000101,452,0002,113,536