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 10, 2026 10:18Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:20051,852,37635,533,0001,110,0002,473,984expected "53690865692877528 ", got "53690865436877528 "
2May 10, 2026 10:204,08646,601,56632,829,0001,086,0002,478,080
3May 10, 2026 10:204,10247,502,06732,941,0001,112,0002,490,368
4May 10, 2026 10:204,10452,295,75832,906,0001,160,0002,482,176
5May 10, 2026 10:204,10648,269,85233,054,0001,033,0002,482,176
6May 10, 2026 10:204,11047,541,97332,974,0001,145,0002,478,080
7May 10, 2026 10:204,11649,157,88532,984,0001,179,0002,494,464
8May 10, 2026 10:204,12053,129,87333,043,0001,156,0002,490,368
9May 10, 2026 10:204,12052,975,32633,091,0001,107,0002,486,272