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 listAug 18, 2026 08:13flavio87flavio87Score: 3,645Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2026 08:143,61538,393,21828,997,0001,009,0002,113,536
2Aug 18, 2026 08:143,62038,443,95728,975,0001,076,0002,113,536
3Aug 18, 2026 08:143,63438,538,69729,081,0001,083,0002,113,536
4Aug 18, 2026 08:143,64338,587,15929,146,0001,091,0002,113,536
5Aug 18, 2026 08:143,64539,386,51429,172,0001,087,0002,113,536
6Aug 18, 2026 08:143,66039,001,98829,256,0001,128,0002,113,536
7Aug 18, 2026 08:143,66641,847,92229,417,0001,011,0002,113,536
8Aug 18, 2026 08:143,67139,103,03829,278,0001,197,0002,113,536
9Aug 18, 2026 08:143,67842,227,32829,387,0001,146,0002,113,536