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 28, 2026 19:26Karthik ReddyKarthik ReddyScore: 4,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 28, 2026 19:264,46247,377,52335,875,0001,161,0002,113,536
2Sep 28, 2026 19:264,47247,469,03535,997,0001,128,0002,113,536
3Sep 28, 2026 19:264,48147,515,20436,074,0001,125,0002,113,536
4Sep 28, 2026 19:264,49947,676,12536,226,0001,122,0002,113,536
5Sep 28, 2026 19:264,50147,675,48136,240,0001,125,0002,113,536
6Sep 28, 2026 19:264,50247,703,21136,211,0001,160,0002,113,536
7Sep 28, 2026 19:264,50647,894,11636,266,0001,138,0002,113,536
8Sep 28, 2026 19:264,50647,662,11336,266,0001,136,0002,113,536
9Sep 28, 2026 19:264,53547,965,12736,508,0001,137,0002,113,536