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 listMay 16, 2026 01:26Victor MerckléVictor MerckléScore: 6,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 01:266,94866,615,40557,675,00002,113,536
2May 16, 2026 01:266,94966,801,48657,683,00002,113,536
3May 16, 2026 01:266,95066,441,67557,689,00002,113,536
4May 16, 2026 01:266,95067,368,10257,692,00002,113,536
5May 16, 2026 01:266,95166,841,09457,697,00002,113,536
6May 16, 2026 01:266,95467,347,33657,724,00002,113,536
7May 16, 2026 01:266,95567,065,56856,710,0001,021,0002,113,536
8May 16, 2026 01:266,95667,288,30856,723,0001,018,0002,113,536
9May 16, 2026 01:266,99265,349,18958,036,00002,113,536