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:47Anoushk KharangateAnoushk KharangateScore: 51,130Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2024 10:2650,986486,966,987423,181,31102,174,976
2Apr 30, 2024 07:4851,038503,697,851423,619,46702,174,976
3Apr 30, 2024 10:2651,098489,182,649424,113,38402,293,760
4Apr 30, 2024 07:4851,101482,200,601424,135,95102,179,072
5Apr 30, 2024 07:4851,130487,321,626424,376,73802,174,976
6Apr 30, 2024 10:2651,134499,738,467424,410,83902,174,976
7Apr 29, 2024 08:4751,237485,708,751425,265,95102,179,072
8Apr 29, 2024 08:4751,268494,026,475425,526,85602,179,072
9Apr 29, 2024 08:4751,281486,097,637425,632,83902,301,952