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 listSep 14, 2026 12:54boop34boop34Score: 9,064Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 14, 2026 12:549,03585,177,99173,873,0001,121,0002,113,536
2Sep 14, 2026 12:549,04685,273,44973,860,0001,224,0002,113,536
3Sep 14, 2026 12:549,05085,319,24473,906,0001,209,0002,113,536
4Sep 14, 2026 12:549,05785,363,29673,926,0001,248,0002,113,536
5Sep 14, 2026 12:549,06485,467,54974,022,0001,214,0002,113,536
6Sep 14, 2026 12:549,06585,503,41374,030,0001,217,0002,113,536
7Sep 14, 2026 12:549,11086,035,92374,494,0001,124,0002,113,536
8Sep 14, 2026 12:549,15589,897,59874,736,0001,256,0002,113,536
9Sep 14, 2026 12:549,46788,730,37877,375,0001,202,0002,113,536