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: 38,612Success
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:4938,590341,345,208319,297,0001,000,0002,277,376
2Feb 2, 2026 22:4938,595342,029,661319,337,0001,001,0002,490,368
3Feb 2, 2026 22:4938,597352,388,420319,357,0001,001,0002,494,464
4Feb 2, 2026 22:4938,607347,583,070319,437,0001,001,0002,494,464
5Feb 2, 2026 22:4938,612344,759,117319,482,0001,001,0002,498,560
6Feb 2, 2026 22:4938,633351,790,123318,653,0001,997,0002,277,376
7Feb 2, 2026 22:4938,873347,981,347320,646,0001,997,0002,277,376
8Feb 2, 2026 22:4938,874353,378,902320,657,0001,997,0002,494,464
9Feb 2, 2026 22:4938,932348,270,729322,133,0001,000,0002,277,376