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 listNov 13, 2024 07:37Igor ZyginIgor ZyginScore: 88,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 13, 2024 07:3788,139762,412,597658,595,00072,955,0002,420,736
2Nov 13, 2024 07:3788,149758,191,509658,676,00072,964,0002,416,640
3Nov 13, 2024 07:3788,169758,443,845658,822,00072,980,0002,469,888
4Nov 13, 2024 07:3788,173758,278,143660,855,00070,984,0002,469,888
5Nov 13, 2024 07:3788,242762,588,949660,469,00071,942,0002,404,352
6Nov 13, 2024 07:3788,262764,411,545662,617,00069,959,0002,543,616
7Nov 13, 2024 07:3788,628760,984,683661,649,00073,960,0002,424,832
8Nov 13, 2024 07:3788,687763,494,441664,089,00072,009,0002,543,616
9Nov 13, 2024 07:3788,740761,499,235658,592,00077,951,0002,428,928