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 9, 2025 18:32alxmrcktralxmrcktrScore: 387,736Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2025 18:32387,0113,241,337,3853,153,203,00058,985,0002,355,200
2Feb 9, 2025 18:32387,5043,250,065,6043,142,327,00073,960,0002,281,472
3Feb 9, 2025 18:32387,6393,240,674,5363,151,433,00065,967,0002,453,504
4Feb 9, 2025 18:32387,6973,248,418,2533,145,935,00071,952,0002,281,472
5Feb 9, 2025 18:32387,7363,244,258,5203,147,247,00070,960,0002,281,472
6Feb 9, 2025 18:32388,3053,248,474,2143,158,972,00063,958,0002,289,664
7Feb 9, 2025 18:32388,5733,256,208,8523,167,190,00057,966,0002,289,664
8Feb 9, 2025 18:32388,6693,259,953,0683,153,995,00071,954,0002,285,568
9Feb 9, 2025 18:32390,9793,275,812,7413,173,171,00071,958,0002,289,664