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 listFeb 29, 2024 16:51Matt StuchlikMatt StuchlikScore: 73,032Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 29, 2024 16:5269,220634,355,000574,522,81802,260,992
2Feb 29, 2024 16:5269,286639,242,013575,076,98002,248,704
3Feb 29, 2024 16:5269,343630,476,250575,544,66902,260,992
4Feb 29, 2024 16:5173,013666,009,327606,009,15502,228,224
5Feb 29, 2024 17:0273,032672,940,992606,164,51002,367,488
6Feb 29, 2024 17:0273,042661,320,140606,249,54902,224,128
7Feb 29, 2024 16:5173,285661,918,358608,268,98802,224,128
8Feb 29, 2024 17:0273,430670,824,552609,472,28302,232,320
9Feb 29, 2024 16:5173,552674,886,625610,478,47902,228,224