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:30Teow Hua JunTeow Hua JunScore: 8,075Success
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:308,07176,786,49365,722,0001,270,0002,113,536
2Aug 3, 2026 16:308,07376,811,84265,743,0001,271,0002,113,536
3Aug 3, 2026 16:308,07477,632,10365,739,0001,276,0002,113,536
4Aug 3, 2026 16:308,07476,811,65266,006,0001,015,0002,113,536
5Aug 3, 2026 16:308,07576,832,12766,019,0001,008,0002,113,536
6Aug 3, 2026 16:308,08076,929,84566,061,0001,009,0002,113,536
7Aug 3, 2026 16:308,08176,869,61366,066,0001,008,0002,113,536
8Aug 3, 2026 16:308,08178,137,00266,064,0001,009,0002,113,536
9Aug 3, 2026 16:308,08376,986,00066,085,0001,008,0002,113,536