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 29, 2022 06:34apuxbtapuxbtScore: 70,900Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2022 06:3470,864654,170,431588,172,65102,273,280
2Nov 29, 2022 06:3470,900654,010,388588,467,64802,277,376
3Nov 29, 2022 06:3470,963651,446,382588,992,22502,260,992