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 11, 2024 09:33ndbnndbnScore: 154,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 09:33154,4951,302,850,1031,200,356,00081,956,0002,428,928
2Nov 11, 2024 09:33154,5151,304,274,1761,198,506,00083,965,0002,433,024
3Nov 11, 2024 09:33154,5301,308,724,7451,213,618,00068,978,0002,428,928
4Nov 11, 2024 09:33154,5621,306,705,0181,182,878,00099,989,0002,281,472
5Nov 11, 2024 09:33154,6111,313,553,7681,194,326,00088,949,0002,424,832
6Nov 11, 2024 09:33154,7031,310,605,2841,201,096,00082,937,0002,433,024
7Nov 11, 2024 09:33154,9211,310,487,0281,205,919,00079,928,0002,273,280
8Nov 11, 2024 09:33155,2611,318,211,2331,191,843,00096,824,0002,273,280
9Nov 11, 2024 09:33155,3941,317,027,2501,202,784,00086,984,0002,281,472