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:42GraceGraceScore: 41,851Success
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:4241,695410,241,444346,067,56302,265,088
2Jun 7, 2024 17:4241,696397,896,229346,075,04502,273,280
3Jun 7, 2024 17:4241,732406,694,710346,372,41102,256,896
4Jun 7, 2024 17:4241,747417,732,847346,501,94102,260,992
5Jun 7, 2024 17:4241,796425,563,048346,903,79602,277,376
6Jun 7, 2024 17:4241,848417,787,634347,342,34302,265,088
7Jun 7, 2024 17:4241,851414,686,409347,364,35902,269,184
8Jun 7, 2024 17:4241,862413,457,725347,458,02202,273,280
9Jun 7, 2024 17:4242,080417,416,073349,261,37702,260,992
10Jun 7, 2024 17:4242,108408,663,174349,493,27102,256,896
11Jun 7, 2024 17:4243,001427,807,705356,905,89702,265,088
12Jun 7, 2024 17:4243,090428,599,005357,644,03602,260,992