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 listJan 12, 2023 01:07Kevin HeaveyKevin HeaveyScore: 52,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2023 00:5952,831496,056,002438,497,20402,224,128
2Jan 12, 2023 00:5952,832524,719,738438,503,67702,232,320
3Jan 12, 2023 00:5952,839505,143,068438,564,20802,256,896
4Jan 12, 2023 00:5952,841521,034,378438,578,72502,228,224
5Jan 12, 2023 01:0752,841488,980,950438,581,18202,220,032
6Jan 12, 2023 01:0752,847508,905,491438,630,35202,232,320
7Jan 12, 2023 01:0752,848503,600,911438,638,24002,220,032
8Jan 12, 2023 00:5952,852505,115,179438,675,06102,228,224
9Jan 12, 2023 00:5952,853496,146,469438,681,52602,228,224