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 listOct 2, 2026 18:13Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 18:13090,328,87178,390,0003,033,00020,480expected "53687338121041224 ", got "589M1685 1637 1543 1642 1632 1549 1641 1539 1640 1647 1545 1635 1637 1550 1642 2588|1646 1641 1540 1643 1636 1541 1642 1542 1637 1645 1546 1645 1638 1551 1647 2586| "
2Oct 2, 2026 18:13095,345,39280,140,0006,208,00020,480expected "53684639184219223 ", got "590M1692 1644 1551 1650 1637 1550 1658 1541 1647 1652 1545 1659 1650 1581 2008 2647|1651 1644 1548 1644 1632 1554 1652 1544 1651 1653 1547 1660 1646 1581 2013 2642| "
3Oct 2, 2026 18:13090,409,01978,595,0002,823,00020,480expected "53683169949925547 ", got "594M1678 1653 1544 1640 1638 1568 1658 1541 1645 1658 1550 1644 1639 1548 1642 2595|1645 1647 1543 1640 1635 1561 1653 1543 1645 1655 1550 1645 1641 1547 1642 2589| "