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 3, 2026 14:33Teow Hua JunTeow Hua JunScore: 11,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 14:3411,866108,322,33897,404,0001,086,0002,113,536
2Aug 3, 2026 14:3411,879108,416,09497,516,0001,081,0002,113,536
3Aug 3, 2026 14:3411,880108,413,58297,541,0001,068,0002,113,536
4Aug 3, 2026 14:3411,882108,457,66797,547,0001,079,0002,113,536
5Aug 3, 2026 14:3411,882108,480,24797,541,0001,085,0002,113,536
6Aug 3, 2026 14:3411,885108,926,95297,562,0001,090,0002,113,536
7Aug 3, 2026 14:3411,891116,376,58797,583,0001,117,0002,113,536
8Aug 3, 2026 14:3411,892108,558,85497,630,0001,081,0002,113,536
9Aug 3, 2026 14:3411,897108,555,06997,679,0001,072,0002,113,536