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:13092,012,19378,852,0004,114,00020,480expected "53681311324121043 ", got "1789 1653 1552 1655 1661 1557 1653 1553 1665 1652 1554 1650 1720 1575 1700 2636|1647 1648 1548 1653 1651 1562 1653 1553 1662 1658 1561 1659 1665 1552 1699 2614| "
2Oct 2, 2026 18:13091,344,50378,560,0003,778,00020,480expected "53687643075912723 ", got "1786 1647 1551 1654 1651 1566 1649 1534 1639 1640 1535 1639 1641 1542 1705 2619|1647 1648 1549 1655 1647 1568 1646 1538 1641 1638 1539 1640 1642 1545 1704 2606| "
3Oct 2, 2026 18:13091,146,46078,134,0003,930,00020,480expected "53684142617216915 ", got "1786 1645 1544 1645 1638 1549 1640 1545 1639 1639 1536 1641 1637 1545 1694 2606|1647 1639 1540 1641 1637 1543 1637 1539 1637 1640 1538 1640 1636 1546 1687 2588| "