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 7, 2026 17:57TonyTonyScore: 5,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 7, 2026 17:575,68857,010,29644,753,0002,465,0002,113,536
2Aug 7, 2026 17:575,70057,112,21244,781,0002,536,0002,113,536
3Aug 7, 2026 17:575,72658,627,81544,902,0002,632,0002,113,536
4Aug 7, 2026 17:575,73057,319,14044,986,0002,574,0002,113,536
5Aug 7, 2026 17:575,74157,536,23345,028,0002,629,0002,113,536
6Aug 7, 2026 17:575,74157,434,89345,139,0002,515,0002,113,536
7Aug 7, 2026 17:575,74857,613,28344,985,0002,728,0002,113,536
8Aug 7, 2026 17:575,81058,037,18645,651,0002,578,0002,113,536
9Aug 7, 2026 17:575,81958,041,43045,781,0002,517,0002,113,536