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 16, 2026 23:12Tomislav TunkovicTomislav TunkovicScore: 6,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:536,01359,732,40848,803,0001,106,00024,576
2Aug 17, 2026 04:536,01661,094,66848,824,0001,111,00024,576
3Aug 17, 2026 04:536,02159,908,70448,868,0001,113,00024,576
4Aug 17, 2026 04:536,02659,934,70348,902,0001,115,00024,576
5Aug 17, 2026 04:536,02659,861,96648,926,0001,097,00024,576
6Aug 17, 2026 04:536,03760,740,55749,015,0001,098,00024,576
7Aug 17, 2026 04:536,05869,277,87349,080,0001,208,00024,576
8Aug 17, 2026 04:537,37071,045,36660,085,0001,089,00024,576
9Aug 17, 2026 04:537,37871,845,35860,139,0001,100,00024,576