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 11:51Karthik 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 11:52087,753,54477,663,0001,094,0002,113,536expected "53682928656490552 ", got "1858 1651 1551 1645 1644 1551 1650 1549 1651 1649 1545 1643 1634 1546 1639 2596|1646 1649 1542 1641 1641 1543 1650 1546 1650 1649 1543 1644 1642 1545 1644 2573| "
2Oct 2, 2026 11:52087,843,18577,667,0001,103,0002,113,536expected "53682370232820182 ", got "1863 1643 1544 1661 1652 1555 1662 1542 1653 1744 1536 1642 1546 1643 1646 2600|1644 1638 1544 1654 1645 1554 1655 1539 1646 1742 1538 1647 1538 1645 1642 2574| "
3Oct 2, 2026 11:52087,809,08177,570,0001,118,0002,113,536expected "53686211985346749 ", got "1873 1644 1546 1648 1644 1552 1646 1543 1650 1645 1538 1647 1641 1547 1640 2596|1644 1644 1539 1645 1635 1549 1644 1540 1645 1644 1543 1648 1639 1552 1639 2570| "