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 7, 2025 03:47Dave GunawanDave GunawanScore: 1,826,753Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2025 03:471,820,36015,138,786,21915,028,025,00080,962,0002,277,376
2Feb 7, 2025 03:471,820,80815,147,831,40215,044,743,00067,967,0002,265,088
3Feb 7, 2025 03:471,821,64415,151,920,96715,046,672,00072,974,0002,277,376
4Feb 7, 2025 03:471,822,29715,155,848,32415,049,096,00075,965,0002,277,376
5Feb 7, 2025 03:471,826,75315,195,010,09115,104,073,00057,977,0002,289,664
6Feb 7, 2025 03:471,828,67315,212,063,01615,098,020,00079,963,0002,277,376
7Feb 7, 2025 03:471,829,37615,216,262,17015,099,870,00083,954,0002,523,136
8Feb 7, 2025 03:471,830,00015,220,989,61015,118,034,00070,967,0002,277,376
9Feb 7, 2025 03:471,830,06515,223,159,37415,111,571,00077,966,0002,277,376