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 10, 2026 19:04Lan Hoang DaoLan Hoang DaoScore: 70,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2026 19:0470,851598,938,367529,219,00058,849,0002,113,536
2Aug 10, 2026 19:0470,910598,620,816530,507,00058,051,0002,113,536
3Aug 10, 2026 19:0470,916599,388,882529,512,00059,091,0002,113,536
4Aug 10, 2026 19:0470,920598,719,773529,871,00058,772,0002,113,536
5Aug 10, 2026 19:0470,959598,997,735530,484,00058,478,0002,113,536
6Aug 10, 2026 19:0470,990599,313,654531,057,00058,161,0002,113,536
7Aug 10, 2026 19:0471,001599,338,196530,890,00058,419,0002,113,536
8Aug 10, 2026 19:0471,015600,207,495530,985,00058,446,0002,113,536
9Aug 10, 2026 19:0471,024600,237,851530,962,00058,542,0002,113,536