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 11:13Roman LytkinRoman LytkinScore: 387,987Success
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 11:13387,2843,240,337,4863,136,497,00077,962,0002,285,568
2Feb 15, 2025 11:13387,9873,246,914,8123,161,327,00058,968,0002,289,664
3Feb 15, 2025 11:13388,8013,253,212,8723,162,087,00064,960,0002,281,472