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 1, 2025 00:54Dmitrii Kalianov Dmitrii Kalianov Score: 348,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 00:54342,0172,861,892,6672,783,766,00054,975,0002,355,200
2Feb 1, 2025 00:54342,0992,865,218,4972,775,456,00063,964,0002,363,392
3Feb 1, 2025 00:54342,7612,868,923,8062,782,943,00061,976,0002,289,664
4Feb 1, 2025 00:54347,8672,915,864,6502,829,330,00057,965,0002,281,472
5Feb 1, 2025 00:54348,4022,916,472,7422,819,771,00071,968,0002,453,504
6Feb 1, 2025 00:54348,6982,924,259,3462,830,213,00063,982,0002,285,568
7Feb 1, 2025 00:54349,1382,924,711,8012,840,872,00056,977,0002,289,664
8Feb 1, 2025 00:54349,2782,932,249,5692,836,049,00062,956,0002,289,664
9Feb 1, 2025 00:54351,8472,945,971,0982,860,361,00059,965,0002,289,664