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 listJan 3, 2025 06:40Rohan KapurRohan KapurScore: 403,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 3, 2025 06:40403,3113,377,945,0573,280,513,00066,969,0002,281,472
2Jan 3, 2025 06:40403,6933,382,455,1163,276,679,00073,970,0002,281,472
3Jan 3, 2025 06:40403,7203,378,511,4163,281,922,00068,956,0002,289,664
4Jan 3, 2025 06:40403,7503,378,605,9363,301,151,00049,972,0002,371,584
5Jan 3, 2025 06:40403,7503,379,720,8203,286,162,00064,963,0002,502,656
6Jan 3, 2025 06:40404,4403,384,079,2093,288,880,00067,976,0002,281,472
7Jan 3, 2025 06:40405,5073,394,831,2273,289,736,00075,970,0002,281,472
8Jan 3, 2025 06:40406,0383,394,109,5683,305,156,00064,963,0002,289,664
9Jan 3, 2025 06:40408,2953,420,361,6983,305,902,00082,947,0002,285,568