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 10:47Priyanshu GuptaPriyanshu GuptaScore: 73,472Success
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 10:4773,328638,188,790553,660,00054,966,0002,277,376
2Oct 24, 2025 10:4773,334630,204,053554,699,00053,970,0002,285,568
3Oct 24, 2025 10:4773,364632,020,380547,929,00060,992,0002,277,376
4Oct 24, 2025 10:4773,393632,700,502559,152,00050,013,0002,285,568
5Oct 24, 2025 10:4773,472632,985,989547,835,00061,981,0002,277,376
6Oct 24, 2025 10:4773,497633,517,897559,024,00051,002,0002,269,184
7Oct 24, 2025 10:4773,514633,558,495551,151,00059,016,0002,277,376
8Oct 24, 2025 10:4773,565637,325,275549,634,00060,959,0002,285,568
9Oct 24, 2025 10:4773,669633,495,101551,508,00059,946,0002,277,376