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 6, 2024 10:31Evgen BodunovEvgen BodunovScore: 71,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2024 10:3170,776619,225,778586,438,000999,0002,281,472
2Nov 6, 2024 10:3170,808612,319,332585,708,0001,999,0002,281,472
3Nov 6, 2024 10:3171,208620,569,151589,023,0002,000,0002,510,848
4Nov 6, 2024 10:3171,274622,764,570589,576,0001,998,0002,281,472
5Nov 6, 2024 10:3171,294622,875,696588,742,0002,998,0002,510,848
6Nov 6, 2024 10:3171,316614,589,436591,919,00002,281,472
7Nov 6, 2024 10:3171,321619,171,694590,963,000999,0002,514,944
8Nov 6, 2024 10:3171,335616,440,457589,084,0003,000,0002,281,472
9Nov 6, 2024 10:3171,368623,570,892590,353,0002,001,0002,510,848