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 listOct 12, 2024 03:17BradleyBradleyScore: 266,883Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2024 03:17266,7122,238,357,9572,121,762,00091,946,0002,326,528
2Oct 12, 2024 03:17266,7882,248,803,5232,111,419,000102,922,0002,482,176
3Oct 12, 2024 03:17266,8352,246,315,8862,106,794,000107,938,0002,486,272
4Oct 12, 2024 03:17266,8482,244,282,1152,116,893,00097,948,0002,326,528
5Oct 12, 2024 03:17266,8832,241,571,7252,135,163,00079,968,0002,326,528
6Oct 12, 2024 03:17266,9762,245,576,9172,121,946,00093,953,0002,326,528
7Oct 12, 2024 03:17266,9862,242,531,6202,129,027,00086,960,0002,482,176
8Oct 12, 2024 03:17267,1002,242,784,5652,128,974,00087,957,0002,330,624
9Oct 12, 2024 03:17267,2272,247,543,6772,102,038,000115,946,0002,326,528