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 listJan 5, 2025 18:40jaydentankejaydentankeScore: 403,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2025 18:40402,8013,369,009,4733,276,284,00066,964,0002,375,680
2Jan 5, 2025 18:40403,2833,372,857,4673,277,287,00069,963,0002,289,664
3Jan 5, 2025 18:40403,6173,374,998,5423,287,057,00062,962,0002,285,568
4Jan 5, 2025 18:40403,7543,374,454,7643,282,195,00068,962,0002,281,472
5Jan 5, 2025 18:40403,7973,376,899,7663,272,550,00078,965,0002,289,664
6Jan 5, 2025 18:40403,8893,383,710,5063,289,314,00062,967,0002,371,584
7Jan 5, 2025 18:40404,2583,381,900,8053,285,373,00069,965,0002,281,472
8Jan 5, 2025 18:40404,4173,384,603,8183,284,689,00071,971,0002,289,664
9Jan 5, 2025 18:40407,0313,400,247,9863,318,384,00059,970,0002,457,600