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 listAug 28, 2026 19:18Victor MerckléVictor MerckléScore: 5,189Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:195,11651,440,30441,433,0001,033,0002,117,632stderr
2Aug 28, 2026 19:195,16653,257,68741,860,0001,019,0002,117,632stderr
3Aug 28, 2026 19:195,17852,023,50141,965,0001,020,0002,117,632stderr
4Aug 28, 2026 19:195,18852,091,81942,047,0001,020,0002,117,632stderr
5Aug 28, 2026 19:195,18952,019,03542,053,0001,019,0002,117,632stderr
6Aug 28, 2026 19:195,18952,134,55742,052,0001,020,0002,117,632stderr
7Aug 28, 2026 19:195,19252,093,70642,078,0001,023,0002,117,632stderr
8Aug 28, 2026 19:195,19951,574,27742,117,0001,040,0002,117,632stderr
9Aug 28, 2026 19:195,24552,530,10742,519,0001,020,0002,117,632stderr