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 listJun 7, 2024 17:52GraceGraceScore: 41,825Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 17:5241,580396,244,055345,117,76902,265,088
2Jun 7, 2024 17:5241,669399,127,408345,852,17102,269,184
3Jun 7, 2024 17:5241,770415,222,470346,692,67002,269,184
4Jun 7, 2024 17:5241,825417,841,036347,150,66402,269,184
5Jun 7, 2024 17:5242,495421,164,214352,708,03502,265,088
6Jun 7, 2024 17:5242,602415,306,062353,593,15202,273,280