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 13, 2026 10:02Hung T.NguyenHung T.NguyenScore: 61,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 10:0261,410530,868,984430,753,00078,954,0002,281,472
2Mar 13, 2026 10:0261,414537,392,817435,778,00073,962,0002,277,376
3Mar 13, 2026 10:0261,489540,908,162467,328,00043,030,0002,277,376
4Mar 13, 2026 10:0261,492543,578,329447,337,00063,047,0002,281,472
5Mar 13, 2026 10:0261,532536,189,213463,742,00046,973,0002,457,600
6Mar 13, 2026 10:0261,543531,383,501433,836,00076,970,0002,277,376
7Mar 13, 2026 10:0261,559532,935,227427,950,00082,990,0002,367,488
8Mar 13, 2026 10:0261,630537,102,618404,625,000106,901,0002,277,376
9Mar 13, 2026 10:0261,673530,932,637411,907,00099,977,0002,277,376