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 listOct 14, 2024 00:14Joad NacerJoad NacerScore: 4,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 00:144,25059,136,54034,270,0001,007,0002,535,424
2Oct 14, 2024 00:144,31562,733,85632,832,0002,984,0002,531,328
3Oct 14, 2024 00:144,33556,827,18232,979,0002,998,0002,396,160
4Oct 14, 2024 00:144,35560,230,35336,145,00002,531,328
5Oct 14, 2024 00:144,44361,016,06034,881,0001,993,0002,531,328
6Oct 14, 2024 00:144,82368,021,77538,029,0002,001,0002,273,280