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 listOct 2, 2026 07:13Karthik ReddyKarthik ReddyScore: 3,296Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 07:133,28536,317,23526,175,0001,097,0002,113,536
2Oct 2, 2026 07:133,28636,452,25126,183,0001,095,0002,113,536
3Oct 2, 2026 07:133,28936,297,56326,208,0001,094,0002,113,536
4Oct 2, 2026 07:133,29036,311,33726,220,0001,091,0002,113,536
5Oct 2, 2026 07:133,29636,352,05626,256,0001,109,0002,113,536
6Oct 2, 2026 07:133,29636,507,72526,255,0001,103,0002,113,536
7Oct 2, 2026 07:133,29836,333,07026,232,0001,147,0002,113,536
8Oct 2, 2026 07:133,30336,452,58226,314,0001,103,0002,113,536
9Oct 2, 2026 07:133,30836,576,55226,356,0001,107,0002,113,536