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 listJul 4, 2026 00:16zielajzielajScore: 3,454Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:173,32037,423,43326,509,0001,055,0002,113,536
2Jul 4, 2026 00:173,32235,557,00926,538,0001,035,0002,113,536
3Jul 4, 2026 00:173,34335,531,77626,707,0001,042,0002,113,536
4Jul 4, 2026 00:173,42136,392,27727,343,0001,052,0002,113,536
5Jul 4, 2026 00:173,45436,430,37327,626,0001,044,0002,113,536
6Jul 4, 2026 00:173,45936,508,40127,678,0001,033,0002,113,536
7Jul 4, 2026 00:173,50837,155,76828,080,0001,042,0002,113,536
8Jul 4, 2026 00:1759,393500,969,616491,909,0001,054,0002,113,536
9Jul 4, 2026 00:1760,796512,543,780503,479,0001,128,0002,113,536