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 listOct 24, 2025 06:39Rashin SergeyRashin SergeyScore: 67,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2025 06:3966,814579,773,973495,601,00058,952,0002,277,376
2Oct 24, 2025 06:3966,940577,187,900497,644,00057,958,0002,277,376
3Oct 24, 2025 06:3966,969583,957,570493,857,00061,982,0002,285,568
4Oct 24, 2025 06:3967,079579,771,230494,780,00061,972,0002,269,184
5Oct 24, 2025 06:3967,173581,260,914500,581,00056,952,0002,269,184
6Oct 24, 2025 06:3967,209579,579,535493,855,00063,981,0002,273,280
7Oct 24, 2025 06:3967,330582,640,431498,853,00059,982,0002,289,664
8Oct 24, 2025 06:3967,749594,322,611492,404,00069,915,0002,289,664
9Oct 24, 2025 06:3968,714602,096,715484,429,00085,898,0002,273,280