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 listMar 18, 2026 20:57Joel SmithJoel SmithScore: 55,787Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 20:5755,753493,578,364459,752,0002,998,0002,375,680
2Mar 18, 2026 20:5755,755494,609,342461,767,000999,0002,375,680
3Mar 18, 2026 20:5755,765497,541,052460,850,0001,999,0002,478,080
4Mar 18, 2026 20:5755,783495,000,466461,003,0002,000,0002,367,488
5Mar 18, 2026 20:5755,787492,975,259461,028,0002,000,0002,379,776
6Mar 18, 2026 20:5755,795492,200,826462,100,0001,000,0002,375,680
7Mar 18, 2026 20:5755,800496,491,801461,143,0002,000,0002,473,984
8Mar 18, 2026 20:5755,806491,281,211460,188,0003,001,0002,465,792
9Mar 18, 2026 20:5755,881489,472,518461,810,0001,999,0002,383,872