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 15, 2026 11:37Victor MerckléVictor MerckléScore: 6,969Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 11:376,96667,087,32757,820,00002,113,536
2May 15, 2026 11:376,96768,014,37857,827,00002,113,536
3May 15, 2026 11:376,96867,254,71957,837,00002,113,536
4May 15, 2026 11:376,96867,105,33857,839,00002,113,536
5May 15, 2026 11:376,96966,812,53957,847,00002,113,536
6May 15, 2026 11:376,97065,094,81857,856,00002,113,536
7May 15, 2026 11:377,01667,193,18858,237,00002,113,536
8May 15, 2026 11:377,01967,283,97758,264,00002,113,536
9May 15, 2026 11:377,09468,294,17957,865,0001,018,0002,113,536