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 14:40Ivan StepanovIvan StepanovScore: 1,828,033Success
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 14:401,821,13015,152,244,37915,051,410,00063,967,0002,281,472
2Nov 11, 2024 14:401,823,84815,172,893,42815,075,971,00061,971,0002,281,472
3Nov 11, 2024 14:401,824,76415,175,504,39615,075,585,00069,960,0002,281,472
4Nov 11, 2024 14:401,827,76915,208,827,05715,097,506,00072,973,0002,281,472
5Nov 11, 2024 14:401,828,03315,200,796,88615,099,707,00072,969,0002,281,472
6Nov 11, 2024 14:401,828,96715,211,496,13415,112,451,00067,975,0002,281,472
7Nov 11, 2024 14:401,829,83715,230,772,12915,115,694,00071,955,0002,293,760
8Nov 11, 2024 14:401,832,35415,239,731,13515,141,567,00066,971,0002,281,472
9Nov 11, 2024 14:401,851,24815,412,937,61815,282,418,00082,942,0002,281,472