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 16:14TonyTonyScore: 139,767Success
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 16:14137,0961,147,876,0341,108,384,00029,518,0002,113,536
2Aug 2, 2026 16:14137,2381,148,960,0531,109,785,00029,298,0002,113,536
3Aug 2, 2026 16:14137,2631,149,847,5241,110,580,00028,707,0002,113,536
4Aug 2, 2026 16:14139,7311,169,737,2931,131,020,00028,753,0002,113,536
5Aug 2, 2026 16:14139,7671,170,003,0121,131,012,00029,061,0002,113,536
6Aug 2, 2026 16:14139,7751,170,171,7181,131,442,00028,693,0002,113,536
7Aug 2, 2026 16:14139,8041,171,536,9081,131,528,00028,846,0002,113,536
8Aug 2, 2026 16:14139,8271,170,576,8661,131,757,00028,813,0002,113,536
9Aug 2, 2026 16:14139,9081,171,189,0931,132,319,00028,924,0002,113,536