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:52Victor MerckléVictor MerckléScore: 5,331Success
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:535,32051,866,35743,049,0001,109,0002,113,536
2Jun 25, 2026 22:535,32451,708,68743,118,0001,072,0002,113,536
3Jun 25, 2026 22:535,32751,738,55043,127,0001,095,0002,113,536
4Jun 25, 2026 22:535,32751,712,19243,099,0001,121,0002,113,536
5Jun 25, 2026 22:535,33151,867,43943,147,0001,106,0002,113,536
6Jun 25, 2026 22:535,33251,764,68143,179,0001,077,0002,113,536
7Jun 25, 2026 22:535,33451,769,92143,232,0001,046,0002,113,536
8Jun 25, 2026 22:535,35352,020,63743,395,0001,040,0002,113,536
9Jun 25, 2026 22:535,64554,527,57245,723,0001,132,0002,113,536