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:03Lan Hoang DaoLan Hoang DaoScore: 83,570Success
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:0383,501703,054,353635,260,00057,802,0002,113,536
2Aug 10, 2026 19:0383,502703,909,874634,420,00058,648,0002,113,536
3Aug 10, 2026 19:0383,517704,020,205634,414,00058,778,0002,113,536
4Aug 10, 2026 19:0383,534705,285,614634,696,00058,639,0002,113,536
5Aug 10, 2026 19:0383,570703,677,007635,198,00058,441,0002,113,536
6Aug 10, 2026 19:0383,572704,354,313635,474,00058,176,0002,113,536
7Aug 10, 2026 19:0383,576703,673,130634,472,00059,212,0002,113,536
8Aug 10, 2026 19:0383,579703,806,174635,516,00058,194,0002,113,536
9Aug 10, 2026 19:0383,594703,911,487635,430,00058,404,0002,113,536