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 28, 2026 19:56Victor MerckléVictor MerckléScore: 5,299Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 19:575,23052,422,47242,395,0001,020,0002,117,632stderr
2Aug 28, 2026 19:575,24952,539,14742,552,0001,021,0002,117,632stderr
3Aug 28, 2026 19:575,27952,911,57442,794,0001,022,0002,117,632stderr
4Aug 28, 2026 19:575,28052,921,56442,809,0001,022,0002,117,632stderr
5Aug 28, 2026 19:575,29953,083,96642,964,0001,020,0002,117,632stderr
6Aug 28, 2026 19:575,30153,105,26342,975,0001,031,0002,117,632stderr
7Aug 28, 2026 19:575,30953,099,70843,046,0001,019,0002,117,632stderr
8Aug 28, 2026 19:575,36253,486,54943,471,0001,039,0002,117,632stderr
9Aug 28, 2026 19:575,37259,645,62643,557,0001,032,0002,117,632stderr