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 listDec 1, 2025 19:13Rajarshi BasuRajarshi BasuScore: 12,047Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 1, 2025 19:1312,040130,175,96698,929,000999,0002,281,472
2Dec 1, 2025 19:1312,040125,938,97597,936,0001,998,0002,367,488
3Dec 1, 2025 19:1312,040124,986,30897,936,0001,998,0002,371,584
4Dec 1, 2025 19:1312,040126,629,37697,937,0001,998,0002,387,968
5Dec 1, 2025 19:1312,041125,242,97197,945,0001,998,0002,383,872
6Dec 1, 2025 19:1312,044126,065,85797,967,0001,999,0002,375,680
7Dec 1, 2025 19:1312,047124,175,61597,989,0001,999,0002,289,664
8Dec 1, 2025 19:1312,052125,861,42998,035,0002,000,0002,289,664
9Dec 1, 2025 19:1312,057128,166,06998,071,0002,001,0002,289,664
10Dec 1, 2025 19:1312,294130,448,096101,039,0001,000,0002,289,664
11Dec 1, 2025 19:1312,317128,511,473100,230,0002,004,0002,289,664
12Dec 1, 2025 19:1312,348132,657,571101,486,0001,004,0002,379,776