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 23, 2025 21:08Cameron AavikCameron AavikScore: 21,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 21:0821,543205,571,885119,869,00058,935,0002,441,216
2Jan 23, 2025 21:0821,574210,097,394122,045,00057,021,0002,441,216
3Jan 23, 2025 21:0821,600208,505,597117,186,00062,098,0002,379,776
4Jan 23, 2025 21:0821,679207,139,602119,957,00059,978,0002,457,600
5Jan 23, 2025 21:0821,700207,761,093128,080,00052,032,0002,437,120
6Jan 23, 2025 21:0821,707209,228,419113,103,00067,061,0002,359,296
7Jan 23, 2025 21:0821,781208,845,383117,861,00062,925,0002,392,064
8Jan 23, 2025 21:0822,025210,752,036123,870,00058,938,0002,457,600
9Jan 23, 2025 21:0822,062209,799,015124,077,00059,037,0002,379,776