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 listApr 15, 2025 13:24Michael CMichael CScore: 1,826,390Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2025 13:241,825,62415,180,813,45515,075,711,00076,967,0002,277,376
2Apr 15, 2025 13:241,825,66415,194,128,83915,082,047,00070,967,0002,277,376
3Apr 15, 2025 13:241,826,01015,189,874,38715,090,911,00064,973,0002,289,664
4Apr 15, 2025 13:241,826,20015,185,475,56615,084,488,00072,968,0002,277,376
5Apr 15, 2025 13:241,826,39015,189,651,99415,099,067,00059,972,0002,289,664
6Apr 15, 2025 13:241,826,69915,192,702,45915,083,644,00077,961,0002,265,088
7Apr 15, 2025 13:241,826,74215,194,402,86315,091,988,00069,972,0002,277,376
8Apr 15, 2025 13:241,827,20915,197,186,48715,100,866,00064,969,0002,277,376
9Apr 15, 2025 13:241,827,79415,205,306,77715,105,722,00064,972,0002,277,376