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 12, 2026 15:52Victor MerckléVictor MerckléScore: 9,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 15:539,44187,763,06677,265,0001,099,0002,113,536
2May 12, 2026 15:539,44489,443,13577,265,0001,127,0002,113,536
3May 12, 2026 15:539,44687,799,49277,283,0001,126,0002,113,536
4May 12, 2026 15:539,45089,083,07977,259,0001,181,0002,113,536
5May 12, 2026 15:539,45288,713,68677,271,0001,182,0002,113,536
6May 12, 2026 15:539,45287,336,84577,276,0001,183,0002,113,536
7May 12, 2026 15:539,45788,895,72677,317,0001,180,0002,113,536
8May 12, 2026 15:539,46789,073,55177,497,0001,083,0002,113,536
9May 12, 2026 15:539,49189,403,98677,594,0001,188,0002,113,536