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 12, 2026 05:26Victor MerckléVictor MerckléScore: 3,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 05:273,79139,982,88730,313,0001,155,0002,117,632stderr
2Aug 12, 2026 05:273,79839,981,28430,417,0001,108,0002,117,632stderr
3Aug 12, 2026 05:273,80639,870,52830,488,0001,110,0002,117,632stderr
4Aug 12, 2026 05:273,81641,170,89130,579,0001,097,0002,117,632stderr
5Aug 12, 2026 05:273,82440,156,38530,628,0001,119,0002,117,632stderr
6Aug 12, 2026 05:273,82540,291,56730,531,0001,218,0002,117,632stderr
7Aug 12, 2026 05:273,82640,169,61730,676,0001,081,0002,117,632stderr
8Aug 12, 2026 05:273,88640,660,48631,240,0001,019,0002,117,632stderr
9Aug 12, 2026 05:274,17943,140,42733,607,0001,079,0002,117,632stderr