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 25, 2026 22:44Victor MerckléVictor MerckléScore: 5,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 22:455,35651,926,69843,368,0001,090,0002,113,536
2Jun 25, 2026 22:455,36352,565,07843,413,0001,101,0002,113,536
3Jun 25, 2026 22:455,36752,392,06443,464,0001,090,0002,113,536
4Jun 25, 2026 22:455,37052,097,17443,483,0001,089,0002,113,536
5Jun 25, 2026 22:455,37552,268,26243,533,0001,086,0002,113,536
6Jun 25, 2026 22:455,37752,451,03143,553,0001,077,0002,113,536
7Jun 25, 2026 22:455,37952,136,84643,522,0001,131,0002,113,536
8Jun 25, 2026 22:455,39852,703,23643,688,0001,121,0002,113,536
9Jun 25, 2026 22:455,50954,884,48744,625,0001,107,0002,113,536