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 listMay 16, 2026 00:07Victor MerckléVictor MerckléScore: 6,959Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 00:076,94964,912,54756,641,0001,039,0002,113,536
2May 16, 2026 00:076,95365,567,93556,668,0001,048,0002,113,536
3May 16, 2026 00:076,95465,668,25656,686,0001,033,0002,113,536
4May 16, 2026 00:076,95565,966,70156,721,0001,012,0002,113,536
5May 16, 2026 00:076,95965,065,70456,761,0001,002,0002,113,536
6May 16, 2026 00:077,01566,229,63657,226,0001,004,0002,113,536
7May 16, 2026 00:077,02067,782,94357,242,0001,025,0002,113,536
8May 16, 2026 00:077,18867,018,20958,619,0001,046,0002,113,536
9May 16, 2026 00:077,18969,138,19058,641,0001,033,0002,113,536