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 00:00drewbumpasdrewbumpasScore: 523,510Success
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 00:01523,1044,352,043,1864,279,730,00062,041,0002,113,536
2Sep 14, 2026 00:01523,1794,353,332,9074,279,343,00063,046,0002,113,536
3Sep 14, 2026 00:01523,1864,352,748,2034,279,398,00063,046,0002,113,536
4Sep 14, 2026 00:01523,2794,353,704,9514,280,161,00063,058,0002,113,536
5Sep 14, 2026 00:01523,5104,355,306,8224,282,046,00063,090,0002,113,536
6Sep 14, 2026 00:01523,5564,355,733,6264,282,273,00063,245,0002,113,536
7Sep 14, 2026 00:01524,3544,362,387,4014,288,097,00064,046,0002,113,536
8Sep 14, 2026 00:01531,7094,423,388,3284,350,139,00063,050,0002,113,536
9Sep 14, 2026 00:01533,2464,436,342,1834,362,896,00063,048,0002,113,536