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 listAug 2, 2026 17:12TonyTonyScore: 136,421Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:13136,1671,140,003,8681,107,078,00023,111,0002,113,536
2Aug 2, 2026 17:13136,1811,140,375,4431,107,035,00023,273,0002,113,536
3Aug 2, 2026 17:13136,2001,140,387,6371,107,338,00023,125,0002,113,536
4Aug 2, 2026 17:13136,2021,143,382,3081,107,345,00023,134,0002,113,536
5Aug 2, 2026 17:13136,4211,142,305,9071,109,180,00023,121,0002,113,536
6Aug 2, 2026 17:13136,4891,142,849,8731,109,203,00023,659,0002,113,536
7Aug 2, 2026 17:13137,0101,147,114,7941,114,153,00023,035,0002,113,536
8Aug 2, 2026 17:13137,9211,154,713,8671,121,541,00023,207,0002,113,536
9Aug 2, 2026 17:13138,8231,162,198,9531,129,038,00023,197,0002,113,536