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 20, 2026 10:24M-RochatM-RochatScore: 6,949Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:246,84266,890,10754,704,0002,089,0002,113,536
2May 20, 2026 10:246,85869,264,93354,847,0002,076,0002,113,536
3May 20, 2026 10:246,93369,241,94055,387,0002,160,0002,113,536
4May 20, 2026 10:246,94567,031,63555,488,0002,156,0002,113,536
5May 20, 2026 10:246,94971,304,72455,530,0002,151,0002,113,536
6May 20, 2026 10:246,95269,130,69355,538,0002,168,0002,113,536
7May 20, 2026 10:246,96067,264,36355,605,0002,164,0002,113,536
8May 20, 2026 10:246,96168,783,91155,608,0002,170,0002,113,536
9May 20, 2026 10:246,98167,673,98455,751,0002,194,0002,113,536