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 listAug 28, 2026 05:43Victor MerckléVictor MerckléScore: 5,483Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:445,46360,203,81944,203,0001,143,0002,113,536
2Aug 28, 2026 05:445,47260,898,90544,273,0001,147,0002,113,536
3Aug 28, 2026 05:445,47660,276,50944,293,0001,164,0002,113,536
4Aug 28, 2026 05:445,47664,301,53244,317,0001,137,0002,113,536
5Aug 28, 2026 05:445,48363,211,26944,353,0001,156,0002,113,536
6Aug 28, 2026 05:445,49463,255,38044,463,0001,140,0002,113,536
7Aug 28, 2026 05:445,49763,447,71844,467,0001,163,0002,113,536
8Aug 28, 2026 05:445,53362,344,37344,783,0001,144,0002,113,536
9Aug 28, 2026 05:445,67063,386,60345,991,0001,076,0002,113,536