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:32Lan Hoang DaoLan Hoang DaoScore: 62,586Success
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:3262,535529,059,452461,688,00057,356,0002,113,536
2Aug 10, 2026 21:3262,566534,045,753461,576,00057,730,0002,113,536
3Aug 10, 2026 21:3262,576530,122,038460,884,00058,502,0002,113,536
4Aug 10, 2026 21:3262,580529,484,374461,820,00057,598,0002,113,536
5Aug 10, 2026 21:3262,586530,343,455460,745,00058,720,0002,113,536
6Aug 10, 2026 21:3262,633529,887,035461,687,00058,175,0002,113,536
7Aug 10, 2026 21:3262,717530,770,293461,464,00059,091,0002,113,536
8Aug 10, 2026 21:3262,734530,778,377462,431,00058,263,0002,113,536
9Aug 10, 2026 21:3262,743531,589,930460,946,00059,828,0002,113,536