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 listMay 2, 2025 17:31Gerard SmitGerard SmitScore: 57,123Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 2, 2025 17:3157,093503,168,440471,875,0001,999,0002,383,872
2May 2, 2025 17:3157,096496,938,913471,897,0001,999,0002,404,352
3May 2, 2025 17:3157,098498,531,625472,913,000999,0002,392,064
4May 2, 2025 17:3157,103497,047,262471,960,0001,999,0002,387,968
5May 2, 2025 17:3157,123502,003,452472,119,0002,000,0002,396,160
6May 2, 2025 17:3157,128500,045,241473,161,0001,000,0002,301,952
7May 2, 2025 17:3157,147494,685,032472,323,0002,001,0002,301,952
8May 2, 2025 17:3157,149503,989,305474,338,00002,310,144
9May 2, 2025 17:3157,182507,967,283472,609,0001,998,0002,314,240