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:14virusegvirusegScore: 138,021Success
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:14137,4001,166,552,025940,524,000199,898,0002,293,760
2Dec 9, 2024 15:14137,4911,169,709,672935,146,000206,032,0002,306,048
3Dec 9, 2024 15:14137,6521,170,648,723955,589,000186,919,0002,535,424
4Dec 9, 2024 15:14137,8131,172,425,980917,878,000225,970,0002,535,424
5Dec 9, 2024 15:14138,0211,169,850,467916,659,000228,914,0002,318,336
6Dec 9, 2024 15:14138,0541,172,984,754950,874,000194,974,0002,293,760
7Dec 9, 2024 15:14138,1181,178,213,396941,491,000204,889,0002,535,424
8Dec 9, 2024 15:14138,1591,175,470,671938,772,000207,949,0002,293,760
9Dec 9, 2024 15:14138,7581,183,265,193926,749,000224,939,0002,314,240