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 listFeb 15, 2025 10:22Roman LytkinRoman LytkinScore: 439,401Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2025 10:22439,3003,673,006,0543,594,230,00051,959,0002,457,600
2Feb 15, 2025 10:22439,4013,674,229,8963,582,062,00064,964,0002,293,760
3Feb 15, 2025 10:22440,0263,683,362,0723,594,273,00057,939,0002,408,448