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 listMar 30, 2026 17:04Dominique GarmierDominique GarmierScore: 7,668Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 30, 2026 17:077,57992,243,84260,910,0001,997,0002,334,720
2Mar 30, 2026 17:047,62788,530,24062,299,0001,004,0002,330,624
3Mar 30, 2026 09:527,64189,147,16062,418,0001,006,0002,326,528
4Mar 30, 2026 09:527,66090,399,52962,572,0001,009,0002,330,624
5Mar 30, 2026 09:527,66897,193,83563,642,00002,326,528
6Mar 30, 2026 17:077,68487,646,83061,786,0001,993,0002,342,912
7Mar 30, 2026 17:047,76586,547,39664,448,00002,326,528
8Mar 30, 2026 17:047,80689,640,72564,792,00002,289,664
9Mar 30, 2026 17:077,97296,563,51664,160,0002,005,0002,326,528