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 10:06Teow Hua JunTeow Hua JunScore: 12,750Success
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 10:0612,741115,578,226104,697,0001,061,0002,113,536
2Aug 3, 2026 10:0612,743115,612,511104,690,0001,082,0002,113,536
3Aug 3, 2026 10:0612,749115,643,896104,758,0001,066,0002,113,536
4Aug 3, 2026 10:0612,750115,644,291104,746,0001,081,0002,113,536
5Aug 3, 2026 10:0612,750115,664,947104,742,0001,090,0002,117,632
6Aug 3, 2026 10:0612,751115,719,462104,760,0001,075,0002,113,536
7Aug 3, 2026 10:0612,752115,586,160104,775,0001,073,0002,113,536
8Aug 3, 2026 10:0612,755115,677,323104,806,0001,066,0002,113,536
9Aug 3, 2026 10:0612,757115,708,436104,790,0001,095,0002,113,536