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 15:39Karthik 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 15:39087,781,89477,607,0001,114,0002,113,536expected "53683376375843195 ", got "1789 1648 1545 1646 1638 1551 1642 1546 1648 1646 1540 1641 1642 1550 1644 2587|1646 1644 1542 1647 1642 1546 1649 1543 1652 1646 1542 1643 1638 1548 1644 2574| "
2Oct 2, 2026 15:39087,819,16877,685,0001,091,0002,113,536expected "53681289081875348 ", got "1851 1641 1540 1645 1632 1547 1640 1541 1643 1643 1538 1640 1637 1549 1642 2589|1644 1642 1539 1637 1633 1538 1639 1541 1639 1645 1537 1642 1638 1544 1646 2566| "
3Oct 2, 2026 15:39087,660,64577,570,0001,102,0002,113,536expected "53680857234243944 ", got "1781 1657 1545 1649 1639 1548 1644 1541 1645 1642 1537 1638 1634 1554 1645 2586|1648 1660 1545 1644 1640 1548 1646 1537 1643 1645 1533 1639 1634 1543 1647 2571| "