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 21, 2024 14:41mahdi739mahdi739Score: 55,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 14:4155,904487,601,266462,006,0002,000,0002,285,568
2Dec 21, 2024 14:4155,923491,503,208464,159,00002,281,472
3Dec 21, 2024 14:4155,955497,120,180464,424,00002,379,776
4Dec 21, 2024 14:4155,956489,202,473463,436,0001,000,0002,281,472
5Dec 21, 2024 14:4155,962497,274,986463,486,0001,001,0002,285,568
6Dec 21, 2024 14:4155,985491,660,158463,676,000999,0002,285,568
7Dec 21, 2024 14:4156,011488,467,088462,893,0001,999,0002,285,568
8Dec 21, 2024 14:4156,038485,677,505464,112,0001,000,0002,281,472
9Dec 21, 2024 14:4156,051487,586,009464,223,0001,000,0002,285,568