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 listJun 17, 2026 09:57DavidDavidScore: 40,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2026 09:5840,009341,135,087331,074,0001,003,0002,113,536
2Jun 17, 2026 09:5840,010341,090,488331,080,0001,004,0002,113,536
3Jun 17, 2026 09:5840,010341,140,615331,088,0001,003,0002,113,536
4Jun 17, 2026 09:5840,012341,156,337331,098,0001,008,0002,113,536
5Jun 17, 2026 09:5840,018341,268,867331,151,0001,003,0002,113,536
6Jun 17, 2026 09:5840,022342,394,702331,172,0001,014,0002,113,536
7Jun 17, 2026 09:5840,025341,308,893331,211,0001,004,0002,113,536
8Jun 17, 2026 09:5840,028341,345,209331,232,0001,003,0002,113,536
9Jun 17, 2026 09:5840,038341,333,300331,313,0001,005,0002,113,536