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 14, 2026 18:58wnwnScore: 4,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 18:584,26256,757,44034,366,0001,010,0002,273,280
2Mar 14, 2026 18:584,26655,743,03134,393,0001,011,0002,273,280
3Mar 14, 2026 18:584,26863,655,91134,416,0001,012,0002,498,560
4Mar 14, 2026 18:584,28058,531,91934,510,0001,015,0002,486,272
5Mar 14, 2026 18:584,28257,677,74034,524,0001,015,0002,498,560
6Mar 14, 2026 18:584,29468,424,28334,621,0001,018,0002,486,272
7Mar 14, 2026 18:584,31564,309,07633,826,0001,989,0002,273,280
8Mar 14, 2026 18:584,31758,999,81934,833,000995,0002,273,280
9Mar 14, 2026 18:584,67965,379,96036,841,0001,991,0002,273,280