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 listDec 23, 2024 02:19Christopher MullinsChristopher MullinsScore: 92,588Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2024 02:1992,557797,885,865768,227,00002,322,432
2Dec 23, 2024 02:1992,561793,090,302767,260,0001,000,0002,482,176
3Dec 23, 2024 02:1992,583795,467,294765,442,0002,997,0002,478,080
4Dec 23, 2024 02:1992,583794,316,022766,440,0001,998,0002,322,432
5Dec 23, 2024 02:1992,588797,223,375766,479,0001,998,0002,322,432
6Dec 23, 2024 02:1992,592797,530,642765,516,0002,998,0002,314,240
7Dec 23, 2024 02:1992,605790,536,366766,622,0001,999,0002,306,048
8Dec 23, 2024 02:1992,614796,863,145765,699,0002,998,0002,482,176
9Dec 23, 2024 02:1992,617793,367,269766,719,0001,999,0002,408,448