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 17:45Adam FolwarcznyAdam FolwarcznyScore: 33,047Success
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 17:4533,009304,714,768271,972,0001,999,0002,256,896
2Aug 20, 2025 17:4533,028296,650,063273,131,0001,000,0002,265,088
3Aug 20, 2025 17:4533,029298,415,557272,142,0002,001,0002,523,136
4Aug 20, 2025 17:4533,034302,580,450272,178,0002,001,0002,260,992
5Aug 20, 2025 17:4533,047298,270,296273,288,0001,001,0002,519,040
6Aug 20, 2025 17:4533,058296,261,740274,381,00002,387,968
7Aug 20, 2025 17:4533,093301,808,171273,671,000998,0002,379,776
8Aug 20, 2025 17:4533,097305,683,984274,704,00002,387,968
9Aug 20, 2025 17:4533,110308,845,340272,811,0001,998,0002,392,064