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 listSep 24, 2026 04:46wnwnScore: 3,386Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:473,35636,635,40626,832,0001,031,0002,113,536
2Sep 24, 2026 04:473,37736,833,43527,019,0001,014,0002,113,536
3Sep 24, 2026 04:473,37736,930,57127,022,0001,008,0002,113,536
4Sep 24, 2026 04:473,38136,894,27327,048,0001,018,0002,113,536
5Sep 24, 2026 04:473,38636,932,61527,072,0001,040,0002,113,536
6Sep 24, 2026 04:473,39236,850,53027,131,0001,029,0002,113,536
7Sep 24, 2026 04:473,39236,870,41427,100,0001,054,0002,113,536
8Sep 24, 2026 04:473,39636,833,18827,153,0001,039,0002,113,536
9Sep 24, 2026 04:473,40936,951,40327,260,0001,040,0002,113,536