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 29, 2025 10:53Aman | अमनAman | अमनScore: 58,170Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 10:5358,148507,517,295479,631,0002,997,0002,519,040
2Dec 29, 2025 10:5358,150508,730,955482,641,00002,502,656
3Dec 29, 2025 10:5358,151511,263,537481,655,000999,0002,510,848
4Dec 29, 2025 10:5358,164508,528,502481,761,000999,0002,379,776
5Dec 29, 2025 10:5358,170509,267,433479,817,0002,998,0002,510,848
6Dec 29, 2025 10:5358,183511,821,963480,916,0001,999,0002,510,848
7Dec 29, 2025 10:5358,206508,115,800481,107,0002,000,0002,387,968
8Dec 29, 2025 10:5358,239510,523,466482,383,0001,000,0002,519,040
9Dec 29, 2025 10:5358,275510,394,740481,684,0001,998,0002,383,872