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 5, 2026 13:16wnwnScore: 3,375Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 13:163,29635,827,38026,335,0001,027,0002,113,536
2Sep 5, 2026 13:163,31235,902,04126,468,0001,027,0002,113,536
3Sep 5, 2026 13:163,32235,845,06526,538,0001,039,0002,113,536
4Sep 5, 2026 13:163,33336,167,31226,628,0001,040,0002,113,536
5Sep 5, 2026 13:163,37536,482,29327,005,0001,011,0002,113,536
6Sep 5, 2026 13:163,39136,668,94527,142,0001,011,0002,113,536
7Sep 5, 2026 13:163,48138,041,05527,891,0001,007,0002,113,536
8Sep 5, 2026 13:163,48738,120,72927,904,0001,045,0002,113,536
9Sep 5, 2026 13:163,52045,526,13228,183,0001,038,0002,113,536