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 15:57Victor MerckléVictor MerckléScore: 15,521Success
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 15:5915,421135,473,066126,884,0001,115,0002,117,632stderr
2Jun 25, 2026 15:5915,457136,175,363127,183,0001,115,0002,117,632stderr
3Jun 25, 2026 15:5915,458135,744,469127,272,0001,035,0002,117,632stderr
4Jun 25, 2026 15:5915,516136,808,375127,638,0001,145,0002,117,632stderr
5Jun 25, 2026 15:5915,521136,556,912127,689,0001,141,0002,117,632stderr
6Jun 25, 2026 15:5915,524136,497,839127,804,0001,053,0002,117,632stderr
7Jun 25, 2026 15:5915,558136,597,305128,005,0001,130,0002,117,632stderr
8Jun 25, 2026 15:5915,659137,582,171128,878,0001,097,0002,117,632stderr
9Jun 25, 2026 15:5915,728138,523,609129,486,0001,064,0002,117,632stderr