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 11, 2022 20:19Jakub BeránekJakub BeránekScore: 395,495Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2022 20:19393,8213,336,945,5673,268,717,91902,310,144
2Jan 11, 2022 20:19395,4953,363,743,0333,282,610,72302,183,168
3Jan 11, 2022 20:19395,7673,354,058,2053,284,868,65802,191,360