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:52GraceGraceScore: 79,402Success
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:5279,081726,415,350656,373,81502,265,088
2Jun 7, 2024 17:5279,092739,982,821656,464,37202,277,376
3Jun 7, 2024 17:5279,324723,367,975658,386,61502,265,088
4Jun 7, 2024 17:5279,402726,592,729659,039,70402,265,088
5Jun 7, 2024 17:5279,453731,894,593659,457,32302,269,184
6Jun 7, 2024 17:5279,616725,966,435660,808,85902,265,088