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:130100,666,48579,125,0003,552,00020,480expected "53679733994633499 ", got "1806 1679 1599 1654 1652 1561 1659 1552 1662 1661 1556 1654 1654 1561 1689 2638|1655 1654 1550 1651 1648 1562 1661 1552 1664 1662 1552 1649 1648 1558 1683 2612| "
2Oct 2, 2026 18:13092,524,30479,225,0004,161,00020,480expected "53679185322788881 ", got "2444 1653 1552 1644 1634 1542 1641 1538 1645 1642 1536 1644 1639 1551 1716 2677|1648 1643 1545 1642 1632 1539 1639 1538 1637 1638 1537 1644 1637 1546 1715 2594| "
3Oct 2, 2026 18:13091,824,76178,912,0003,844,00020,480expected "53685886551695375 ", got "2134 1651 1548 1646 1641 1545 1656 1549 1643 1649 1538 1646 1650 1557 1672 2645|1649 1648 1543 1641 1633 1547 1650 1546 1712 1665 1601 1666 1653 1553 1676 2610| "