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 listApr 26, 2026 00:20olliecrowolliecrowScore: 82,784Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 00:2282,677694,639,521684,223,0002,000,0002,359,296
2Apr 26, 2026 00:2282,683694,790,217685,272,0001,000,0002,334,720
3Apr 26, 2026 00:2282,708695,144,907684,481,0001,998,0002,560,000
4Apr 26, 2026 00:2282,715695,194,011683,540,0002,997,0002,379,776
5Apr 26, 2026 00:2282,784694,729,122686,110,0001,001,0002,375,680
6Apr 26, 2026 00:2282,796694,888,027685,212,0002,000,0002,375,680
7Apr 26, 2026 00:2282,943709,047,911686,435,0001,998,0002,310,144
8Apr 26, 2026 00:2283,658703,029,972692,364,0001,998,0002,375,680
9Apr 26, 2026 00:2284,186707,564,990695,752,0002,998,0002,363,392