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 listFeb 9, 2024 09:54matsuoka-601matsuoka-601Score: 7,085Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2024 09:546,98483,708,67556,966,000999,0002,404,352
2Feb 9, 2024 09:546,98481,911,22955,972,0001,999,0002,519,040
3Feb 9, 2024 09:546,98780,650,73255,995,0001,999,0002,404,352
4Feb 9, 2024 09:546,99382,824,58557,041,0001,000,0002,404,352
5Feb 9, 2024 09:546,99978,770,89956,088,0002,003,0002,523,136
6Feb 9, 2024 09:547,01783,260,29857,234,0001,004,0002,523,136
7Feb 9, 2024 09:547,08590,138,82357,813,000996,0002,523,136
8Feb 9, 2024 09:547,08886,788,48458,834,00002,523,136
9Feb 9, 2024 09:547,08988,417,60657,842,000997,0002,523,136
10Feb 9, 2024 09:547,267135,423,47960,313,65402,285,568
11Feb 9, 2024 09:547,421129,232,85161,597,26202,289,664
12Feb 9, 2024 09:547,435124,448,51361,714,05102,285,568