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 listOct 27, 2025 09:25Tan Lip WeiTan Lip WeiScore: 35,393Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 09:2735,375320,504,416291,616,0001,997,0002,269,184
2Oct 27, 2025 09:2535,382320,503,185291,675,0001,997,0002,269,184
3Oct 27, 2025 09:2735,385319,508,560292,695,000998,0002,277,376
4Oct 27, 2025 09:2735,393326,918,218291,761,0001,998,0002,265,088
5Oct 27, 2025 09:2535,536319,031,207292,947,0001,999,0002,523,136
6Oct 27, 2025 09:2535,562321,250,018293,160,0002,001,0002,269,184