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 7, 2024 17:31spacecat8086spacecat8086Score: 53,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2024 17:3153,752468,261,512444,142,0002,000,0002,289,664
2Nov 7, 2024 17:3153,772472,624,736446,309,00002,289,664
3Nov 7, 2024 17:3153,779473,120,687445,367,0001,000,0002,281,472
4Nov 7, 2024 17:3153,785471,472,865445,418,0001,000,0002,273,280
5Nov 7, 2024 17:3153,785472,437,064445,414,0001,000,0002,289,664
6Nov 7, 2024 17:3153,786476,603,960445,426,0001,000,0002,281,472
7Nov 7, 2024 17:3153,789472,837,613446,448,00002,273,280
8Nov 7, 2024 17:3153,811478,327,124445,631,000999,0002,273,280
9Nov 7, 2024 17:3153,812474,721,295446,641,00002,281,472