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 7, 2026 16:30TonyTonyScore: 6,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 16:306,05560,032,62747,874,0002,388,0002,113,536
2Aug 7, 2026 16:306,05660,109,86947,858,0002,411,0002,113,536
3Aug 7, 2026 16:306,06560,110,39047,964,0002,379,0002,113,536
4Aug 7, 2026 16:306,06860,124,25047,960,0002,406,0002,113,536
5Aug 7, 2026 16:306,12460,690,95348,407,0002,424,0002,113,536
6Aug 7, 2026 16:306,17561,070,17948,686,0002,567,0002,113,536
7Aug 7, 2026 16:306,18561,211,83748,734,0002,607,0002,113,536
8Aug 7, 2026 16:306,19161,214,05548,787,0002,602,0002,113,536
9Aug 7, 2026 16:306,19661,287,85049,396,0002,033,0002,113,536