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 listMay 15, 2026 04:04Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 04:04068,453,99257,121,0001,017,0002,113,536expected "53691314273662436 ", got "53691291233662436 "
2May 15, 2026 04:046,99665,551,61757,028,0001,042,0002,113,536
3May 15, 2026 04:046,99866,060,45258,089,00002,113,536
4May 15, 2026 04:047,01467,230,21057,160,0001,060,0002,113,536
5May 15, 2026 04:047,02067,081,70057,254,0001,012,0002,113,536
6May 15, 2026 04:047,04565,784,21358,478,00002,113,536
7May 15, 2026 04:047,05067,533,01157,509,0001,007,0002,113,536
8May 15, 2026 04:047,05465,900,38457,538,0001,018,0002,113,536
9May 15, 2026 04:047,06068,088,05157,580,0001,024,0002,113,536