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:35Lan Hoang DaoLan Hoang DaoScore: 62,604Success
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:3662,559529,995,669460,815,00058,428,0002,113,536
2Aug 10, 2026 21:3662,577530,134,930460,727,00058,666,0002,113,536
3Aug 10, 2026 21:3662,579530,216,303460,915,00058,495,0002,113,536
4Aug 10, 2026 21:3662,601529,661,529461,721,00057,868,0002,113,536
5Aug 10, 2026 21:3662,604531,605,635460,887,00058,734,0002,113,536
6Aug 10, 2026 21:3662,634530,666,684460,797,00059,070,0002,113,536
7Aug 10, 2026 21:3662,652530,058,872461,657,00058,361,0002,113,536
8Aug 10, 2026 21:3662,654531,025,260460,757,00059,275,0002,113,536
9Aug 10, 2026 21:3662,721531,463,705461,008,00059,579,0002,113,536