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:09BradleyBradleyScore: 1,322,019Success
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:091,303,64710,847,721,06910,746,301,00073,967,0002,265,088
2Oct 12, 2024 03:091,313,80110,943,211,67010,852,575,00051,974,0002,273,280
3Oct 12, 2024 03:091,320,25510,987,803,92710,876,150,00081,963,0002,281,472
4Oct 12, 2024 03:091,320,51210,988,866,38510,884,282,00075,967,0002,281,472
5Oct 12, 2024 03:091,322,01911,005,431,85010,896,792,00075,963,0002,281,472
6Oct 12, 2024 03:091,322,22411,005,416,75810,900,488,00073,969,0002,281,472
7Oct 12, 2024 03:091,322,41411,016,432,45310,904,075,00071,960,0002,281,472
8Oct 12, 2024 03:091,326,22911,040,610,47610,925,731,00081,967,0002,281,472
9Oct 12, 2024 03:091,330,08011,068,908,39710,985,689,00053,978,0002,367,488