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:44GraceGraceScore: 79,543Success
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:4579,228712,942,688657,594,39402,265,088
2Jun 7, 2024 17:4479,253711,913,100657,799,63802,400,256
3Jun 7, 2024 17:4479,437721,865,846659,326,01602,269,184
4Jun 7, 2024 17:4479,437733,081,764659,324,80102,269,184
5Jun 7, 2024 17:4579,467726,855,911659,578,50002,396,160
6Jun 7, 2024 17:4479,495727,564,093659,806,08602,269,184
7Jun 7, 2024 17:4579,543724,273,665660,204,64102,265,088
8Jun 7, 2024 17:4479,598720,579,528660,667,45202,265,088
9Jun 7, 2024 17:4479,598743,045,848660,661,25902,273,280
10Jun 7, 2024 17:4479,665721,392,053661,221,54902,273,280
11Jun 7, 2024 17:4480,400735,251,073667,324,00802,269,184
12Jun 7, 2024 17:4480,542730,127,532668,496,54602,269,184