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 listMay 10, 2026 02:18Josu San MartinJosu San MartinScore: 4,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 02:184,53852,152,04336,581,0001,089,0002,469,888
2May 10, 2026 02:184,62555,673,49037,212,0001,180,0002,469,888
3May 10, 2026 02:184,70356,038,05437,832,0001,210,0002,465,792
4May 10, 2026 02:184,78654,245,79338,564,0001,161,0002,469,888
5May 10, 2026 02:184,83255,298,61938,913,0001,198,0002,469,888
6May 10, 2026 02:184,85056,600,78939,054,0001,207,0002,478,080
7May 10, 2026 02:184,86355,822,20739,276,0001,088,0002,478,080
8May 10, 2026 02:184,88153,066,61339,319,0001,196,0002,465,792
9May 10, 2026 02:184,90657,364,27239,553,0001,175,0002,465,792