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 listApr 28, 2024 15:42Steve HanSteve HanScore: 19,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2024 15:4218,782213,949,021155,893,39602,293,760
2Apr 28, 2024 15:4218,822221,656,345156,220,90002,301,952
3Apr 28, 2024 15:4218,831219,787,167156,295,83602,174,976
4Apr 28, 2024 15:4219,710231,151,972163,592,63902,301,952
5Apr 28, 2024 15:4219,772230,366,311164,106,07402,174,976
6Apr 28, 2024 15:4219,901216,926,213165,180,09802,289,664
7Apr 28, 2024 15:4219,916224,480,805165,304,37502,301,952
8Apr 28, 2024 15:4219,989247,824,457165,911,39002,256,896
9Apr 28, 2024 15:4219,999229,724,425165,988,60602,179,072