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 listApr 22, 2026 09:20wnwnScore: 4,761Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2026 09:214,66955,751,38836,769,0001,987,0002,330,624
2Apr 22, 2026 09:214,69158,513,38936,945,0001,997,0002,490,368
3Apr 22, 2026 09:214,72054,745,74338,172,0001,004,0002,486,272
4Apr 22, 2026 09:214,75255,724,59238,437,0001,011,0002,486,272
5Apr 22, 2026 09:214,76156,844,28038,509,0001,013,0002,478,080
6Apr 22, 2026 09:214,88658,694,39339,547,0001,014,0002,330,624
7Apr 22, 2026 09:214,90260,464,75939,673,0001,017,0002,486,272
8Apr 22, 2026 09:214,92657,288,66138,895,0001,994,0002,486,272
9Apr 22, 2026 09:214,95358,896,63539,105,0002,005,0002,486,272