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 listFeb 11, 2026 20:37olliecrowolliecrowScore: 6,093Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 20:375,73082,369,83445,537,0002,023,0002,334,720
2Feb 11, 2026 20:375,76273,718,41746,826,000996,0002,347,008
3Feb 11, 2026 20:375,80470,326,99045,160,0003,010,0002,347,008
4Feb 11, 2026 20:376,09379,207,39947,539,0003,034,0002,269,184
5Feb 11, 2026 20:376,15076,547,89649,042,0002,001,0002,433,024
6Feb 11, 2026 20:376,25279,935,55048,901,0002,993,0002,314,240