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 listJun 10, 2026 12:51Victor MerckléVictor MerckléScore: 5,715Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 10, 2026 12:525,69454,872,07146,236,0001,027,0002,113,536
2Jun 10, 2026 12:525,69554,859,93246,262,0001,011,0002,113,536
3Jun 10, 2026 12:525,71154,795,40946,382,0001,026,0002,113,536
4Jun 10, 2026 12:525,71254,982,66246,415,0001,001,0002,113,536
5Jun 10, 2026 12:525,71555,079,15446,439,0001,002,0002,113,536
6Jun 10, 2026 12:525,71655,076,35546,420,0001,027,0002,113,536
7Jun 10, 2026 12:525,72355,281,02046,496,0001,006,0002,113,536
8Jun 10, 2026 12:525,75255,619,78846,742,0001,007,0002,113,536
9Jun 10, 2026 12:525,75855,539,20146,715,0001,082,0002,113,536