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:33Victor MerckléVictor MerckléScore: 7,612Success
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:347,59970,596,13361,973,0001,099,0002,113,536
2Jun 25, 2026 15:347,59970,606,39961,991,0001,082,0002,113,536
3Jun 25, 2026 15:347,60770,805,00062,056,0001,083,0002,113,536
4Jun 25, 2026 15:347,60970,762,33262,049,0001,108,0002,113,536
5Jun 25, 2026 15:347,61270,663,01562,099,0001,082,0002,113,536
6Jun 25, 2026 15:347,61270,973,21962,076,0001,106,0002,113,536
7Jun 25, 2026 15:347,62670,780,82362,207,0001,095,0002,113,536
8Jun 25, 2026 15:347,63870,938,80962,295,0001,108,0002,113,536
9Jun 25, 2026 15:347,67771,308,68162,592,0001,133,0002,113,536