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 11:45GraceGraceScore: 85,786Success
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 11:4585,583764,073,889710,340,18102,236,416
2Jun 7, 2024 11:4685,588766,364,518710,377,71202,232,320
3Jun 7, 2024 11:4585,614766,689,795710,597,21402,244,608
4Jun 7, 2024 11:4685,641777,275,484710,817,23502,232,320
5Jun 7, 2024 11:4685,777774,828,637711,945,08302,240,512
6Jun 7, 2024 11:4685,784774,694,011712,004,65802,236,416
7Jun 7, 2024 11:4585,786772,108,546712,022,37702,244,608
8Jun 7, 2024 11:4585,839771,492,261712,463,76802,236,416
9Jun 7, 2024 11:4686,284795,276,686716,159,84602,248,704
10Jun 7, 2024 11:4686,328780,945,982716,522,09402,236,416
11Jun 7, 2024 11:4586,390773,839,646717,040,11802,244,608
12Jun 7, 2024 11:4586,515796,224,123718,070,41002,244,608