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 21:29Lan Hoang DaoLan Hoang DaoScore: 62,598Success
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 21:2962,501529,632,378460,940,00057,826,0002,113,536
2Aug 10, 2026 21:2962,536529,898,716460,920,00058,134,0002,113,536
3Aug 10, 2026 21:2962,544529,248,317460,947,00058,172,0002,113,536
4Aug 10, 2026 21:2962,565529,350,611460,801,00058,492,0002,113,536
5Aug 10, 2026 21:2962,598530,391,745460,899,00058,668,0002,113,536
6Aug 10, 2026 21:2962,628530,634,958460,951,00058,864,0002,113,536
7Aug 10, 2026 21:2962,650531,032,655461,652,00058,351,0002,113,536
8Aug 10, 2026 21:2962,703530,635,494460,808,00059,633,0002,113,536
9Aug 10, 2026 21:2962,713531,262,007460,727,00059,795,0002,113,536