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 20, 2026 09:58Victor MerckléVictor MerckléScore: 5,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 09:595,70355,264,22946,306,0001,030,0002,113,536
2May 20, 2026 09:595,70356,869,31446,314,0001,023,0002,113,536
3May 20, 2026 09:595,70556,931,16746,354,0001,002,0002,113,536
4May 20, 2026 09:595,70756,487,64546,358,0001,018,0002,113,536
5May 20, 2026 09:595,71056,072,50046,361,0001,036,0002,113,536
6May 20, 2026 09:595,80258,496,49247,156,0001,006,0002,113,536
7May 20, 2026 09:595,82556,439,96447,325,0001,029,0002,113,536
8May 20, 2026 09:595,86858,481,29747,668,0001,037,0002,113,536
9May 20, 2026 09:595,88057,119,22947,767,0001,040,0002,113,536