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 listDec 9, 2024 15:03virusegvirusegScore: 285,266Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2024 15:03284,9162,395,745,8242,251,908,000112,895,0002,502,656
2Dec 9, 2024 15:03285,0352,395,313,6092,253,897,000111,895,0002,351,104
3Dec 9, 2024 15:03285,0952,393,250,7012,261,363,000104,924,0002,437,120
4Dec 9, 2024 15:03285,1852,397,009,8792,245,135,000121,898,0002,543,616
5Dec 9, 2024 15:03285,2662,393,208,5402,260,815,000106,896,0002,510,848
6Dec 9, 2024 15:03285,4112,404,803,4562,270,000,00098,912,0002,351,104
7Dec 9, 2024 15:03285,7962,398,317,7032,280,178,00091,926,0002,437,120
8Dec 9, 2024 15:03285,8442,403,014,5482,262,621,000109,884,0002,351,104
9Dec 9, 2024 15:03286,9022,409,502,9162,290,355,00090,934,0002,416,640