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 24, 2026 19:22Victor MerckléVictor MerckléScore: 8,470Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 19:238,43379,359,10568,867,0001,135,0002,117,632stderr
2Jun 24, 2026 19:238,45077,791,18869,039,0001,101,0002,117,632stderr
3Jun 24, 2026 19:238,46078,218,58869,089,0001,134,0002,117,632stderr
4Jun 24, 2026 19:238,46277,969,82969,101,0001,137,0002,117,632stderr
5Jun 24, 2026 19:238,47078,914,25269,176,0001,129,0002,117,632stderr
6Jun 24, 2026 19:238,48178,087,70569,287,0001,109,0002,117,632stderr
7Jun 24, 2026 19:238,48878,557,49569,423,0001,035,0002,117,632stderr
8Jun 24, 2026 19:238,50178,276,77469,482,0001,078,0002,117,632stderr
9Jun 24, 2026 19:238,56978,838,39570,102,0001,025,0002,117,632stderr