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 09:24Anatoly ZhmurAnatoly ZhmurScore: 87,200Success
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 09:2487,050745,468,653635,577,00086,942,0002,359,296
2Nov 11, 2024 09:2487,082749,421,606640,806,00081,975,0002,326,528
3Nov 11, 2024 09:2487,106753,285,814636,982,00085,997,0002,330,624
4Nov 11, 2024 09:2487,136750,701,742637,324,00085,908,0002,338,816
5Nov 11, 2024 09:2487,200751,625,140635,792,00087,971,0002,347,008
6Nov 11, 2024 09:2487,333750,771,361636,884,00087,983,0002,371,584
7Nov 11, 2024 09:2487,801757,682,017636,781,00091,968,0002,490,368
8Nov 11, 2024 09:2487,947762,029,243637,966,00091,995,0002,490,368
9Nov 11, 2024 09:2488,036763,543,689634,740,00095,960,0002,342,912