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 listApr 21, 2026 17:24BenBenScore: 21,814Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 17:2521,720201,151,786177,273,0003,004,0002,527,232
2Apr 21, 2026 17:2521,731196,077,925178,366,0002,004,0002,531,328
3Apr 21, 2026 17:2521,752194,227,080178,542,0002,006,0002,519,040
4Apr 21, 2026 17:2521,768200,684,155177,683,0002,994,0002,527,232
5Apr 21, 2026 17:2521,814199,693,980178,060,0003,001,0002,531,328
6Apr 21, 2026 17:2521,826202,365,729178,155,0003,002,0002,514,944
7Apr 21, 2026 17:2521,853203,024,879179,376,0002,004,0002,514,944
8Apr 21, 2026 17:2521,859201,420,522179,426,0002,004,0002,514,944
9Apr 21, 2026 17:2522,007200,420,869180,652,0002,007,0002,514,944