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 16:21Teow Hua JunTeow Hua JunScore: 8,073Success
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 16:218,07076,837,25465,714,0001,271,0002,113,536
2Aug 3, 2026 16:218,07276,844,12465,733,0001,268,0002,113,536
3Aug 3, 2026 16:218,07376,869,00065,734,0001,277,0002,113,536
4Aug 3, 2026 16:218,07376,825,78665,741,0001,267,0002,113,536
5Aug 3, 2026 16:218,07376,840,18066,005,0001,009,0002,113,536
6Aug 3, 2026 16:218,07676,908,59666,021,0001,010,0002,113,536
7Aug 3, 2026 16:218,07877,038,00065,771,0001,283,0002,113,536
8Aug 3, 2026 16:218,08076,922,02865,786,0001,283,0002,113,536
9Aug 3, 2026 16:218,08076,961,51066,061,0001,009,0002,113,536