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 12, 2026 06:33flavio87flavio87Score: 4,906Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 06:334,86648,775,13038,311,0002,077,0002,113,536
2Aug 12, 2026 06:334,87249,391,89938,434,0002,009,0002,113,536
3Aug 12, 2026 06:334,87648,884,06439,429,0001,043,0002,113,536
4Aug 12, 2026 06:334,88948,935,31038,582,0002,002,0002,113,536
5Aug 12, 2026 06:334,90649,684,11638,696,0002,031,0002,113,536
6Aug 12, 2026 06:334,91549,148,74538,790,0002,012,0002,113,536
7Aug 12, 2026 06:334,93549,965,64438,965,0002,003,0002,113,536
8Aug 12, 2026 06:334,98649,741,65439,388,0002,004,0002,113,536
9Aug 12, 2026 06:335,02150,664,38040,652,0001,024,0002,113,536