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 listSep 4, 2023 20:05mmalczakmmalczakScore: 1,641,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2023 07:011,641,15513,686,276,70513,621,584,80202,252,800
2Aug 30, 2023 07:011,641,74013,681,751,89713,626,438,41602,256,896
3Sep 4, 2023 20:051,641,82613,692,334,72413,627,152,29202,260,992
4Sep 4, 2023 20:051,641,98613,685,479,09513,628,481,70502,252,800
5Aug 30, 2023 07:011,643,41313,719,767,19613,640,329,28802,260,992
6Sep 4, 2023 20:051,645,85013,722,358,36013,660,552,71102,252,800