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 2, 2026 22:49javivallejojavivallejoScore: 37,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2026 22:4937,769342,082,661312,479,0001,001,0002,490,368
2Feb 2, 2026 22:4937,770338,926,504312,493,0001,001,0002,494,464
3Feb 2, 2026 22:4937,773336,539,397312,515,0001,001,0002,478,080
4Feb 2, 2026 22:4937,792338,703,710312,679,000998,0002,535,424
5Feb 2, 2026 22:4937,799342,033,748311,730,0001,998,0002,490,368
6Feb 2, 2026 22:4938,879347,696,266320,698,0001,998,0002,506,752
7Feb 2, 2026 22:4938,885349,520,812320,747,0001,998,0002,281,472
8Feb 2, 2026 22:4938,900342,713,052320,868,0001,999,0002,535,424
9Feb 2, 2026 22:4938,907348,553,180320,932,0001,999,0002,281,472