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 listJan 5, 2026 21:25lipapipalipapipaScore: 54,755Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2026 21:4253,135472,957,739376,162,00064,855,0002,265,088
2Jan 5, 2026 21:4253,146465,066,555375,243,00065,867,0002,273,280
3Jan 5, 2026 21:2553,150467,744,121376,125,00065,021,000299,008
4Jan 5, 2026 21:2553,184466,125,083375,513,00065,914,000303,104
5Jan 5, 2026 21:2553,202466,746,484374,643,00066,936,0002,396,160
6Jan 5, 2026 21:2553,268467,004,726375,258,00066,867,000176,128
7Jan 5, 2026 21:2554,755484,408,729380,552,00073,913,000307,200
8Jan 5, 2026 21:2554,838481,569,910380,294,00074,861,000303,104
9Jan 5, 2026 21:2554,840481,485,708378,309,00076,859,000294,912
10Jan 5, 2026 21:4254,872483,486,852380,692,00074,743,0002,273,280
11Jan 5, 2026 21:2555,144483,574,960382,748,00074,950,000303,104
12Jan 5, 2026 21:2555,173485,076,192385,109,00072,831,0002,396,160