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 25, 2024 23:52Joad NacerJoad NacerScore: 31,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2024 23:5231,419327,512,169260,775,23902,273,280
2Apr 25, 2024 23:5231,422318,439,042260,803,88702,269,184
3Apr 25, 2024 23:5231,424321,682,930260,815,78202,273,280