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 listAug 20, 2025 08:40t19783199t19783199Score: 66,180Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2025 08:4065,996576,247,108487,791,00059,974,0002,367,488
2Aug 20, 2025 08:4066,007570,874,746486,872,00060,984,0002,273,280
3Aug 20, 2025 08:4066,031570,010,450489,050,00059,006,0002,273,280
4Aug 20, 2025 08:4066,078575,891,545489,509,00058,940,0002,273,280
5Aug 20, 2025 08:4066,180576,475,327488,375,00060,922,0002,396,160
6Aug 20, 2025 08:4066,214582,705,061485,629,00063,951,0002,281,472
7Aug 20, 2025 08:4066,224572,449,717486,701,00062,961,0002,273,280
8Aug 20, 2025 08:4066,324574,040,409490,548,00059,944,0002,383,872
9Aug 20, 2025 08:4066,338574,047,411484,650,00065,952,0002,273,280