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 29, 2024 08:45Anoushk KharangateAnoushk KharangateScore: 50,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2024 08:4350,599482,445,686419,974,74802,301,952
2Apr 30, 2024 07:4750,613482,629,911420,085,95602,183,168
3Apr 30, 2024 07:4750,625499,696,865420,184,07402,179,072
4Apr 29, 2024 08:4350,635485,837,770420,269,80302,174,976
5Apr 29, 2024 08:4550,645480,719,877420,351,48602,256,896
6Apr 29, 2024 08:4550,655482,829,643420,439,78402,174,976
7Apr 30, 2024 07:4750,678478,006,897420,624,17502,301,952
8Apr 29, 2024 08:4550,695478,186,853420,764,93302,297,856
9Apr 29, 2024 08:4350,780479,024,492421,471,18502,174,976