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 20, 2024 03:19zielajzielajScore: 3,669Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 20, 2024 03:193,54049,124,58129,379,00002,527,232
2Nov 20, 2024 03:193,54058,393,90828,373,0001,013,0002,379,776
3Nov 20, 2024 03:193,54056,675,23328,368,0001,013,0002,383,872
4Nov 20, 2024 03:193,66952,823,45929,439,0001,015,0002,277,376
5Nov 20, 2024 03:193,69757,540,44429,659,0001,022,0002,387,968
6Nov 20, 2024 03:193,71460,633,61729,835,000994,0002,531,328