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 18, 2026 18:23wnwnScore: 7,491Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 18:236,38674,825,14250,005,0003,000,0002,506,752
2Feb 18, 2026 18:236,41574,705,28452,241,0001,004,0002,502,656
3Feb 18, 2026 18:236,57282,154,30352,531,0002,020,0002,306,048
4Feb 18, 2026 18:237,49188,741,94860,171,0002,005,0002,473,984
5Feb 18, 2026 18:237,56890,024,45062,814,00002,486,272
6Feb 18, 2026 18:237,63984,378,37361,388,0002,012,0002,404,352