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 19, 2025 15:48Rachel TanRachel TanScore: 81,957Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2025 15:4881,760707,042,150620,641,00057,966,0002,355,200
2May 19, 2025 15:4881,764707,752,367612,675,00065,965,0002,289,664
3May 19, 2025 15:4881,845709,919,032624,286,00055,025,0002,351,104
4May 19, 2025 15:4881,880718,809,930623,641,00055,967,0002,359,296
5May 19, 2025 15:4881,957709,670,087602,216,00078,027,0002,285,568
6May 19, 2025 15:4881,961711,790,721617,251,00063,025,0002,363,392
7May 19, 2025 15:4881,993706,594,801597,599,00082,944,0002,351,104
8May 19, 2025 15:4882,012703,335,149597,733,00082,963,0002,359,296
9May 19, 2025 15:4882,075710,363,672595,193,00086,027,0002,285,568