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 listApr 27, 2024 20:46Joad NacerJoad NacerScore: 12,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 20:4612,589170,718,072104,485,83402,281,472
2Apr 27, 2024 20:4612,697158,113,732105,387,11302,281,472
3Apr 27, 2024 20:4612,973135,855,992107,673,00002,519,040
4Apr 27, 2024 20:4612,978134,378,410105,722,0001,994,0002,277,376
5Apr 27, 2024 20:4612,988134,804,850106,802,000998,0002,363,392
6Apr 27, 2024 20:4612,990134,580,936105,823,0001,996,0002,514,944
7Apr 27, 2024 20:4612,992136,903,812105,836,0001,996,0002,285,568
8Apr 27, 2024 20:4613,011131,380,555106,995,000999,0002,510,848
9Apr 27, 2024 20:4613,055128,232,690107,354,0001,003,0002,285,568
10Apr 27, 2024 20:4613,131130,413,179106,985,0001,999,0002,514,944
11Apr 27, 2024 20:4613,433178,037,842111,495,68702,269,184
12Apr 27, 2024 20:4613,731139,435,618111,965,0001,999,0002,277,376