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 18, 2026 14:58Victor MerckléVictor MerckléScore: 5,212Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 18, 2026 14:595,18750,696,34741,912,0001,142,0002,113,536
2Jun 18, 2026 14:595,19450,729,48241,971,0001,143,0002,113,536
3Jun 18, 2026 14:595,19550,733,61841,989,0001,131,0002,113,536
4Jun 18, 2026 14:595,20750,965,86042,083,0001,139,0002,113,536
5Jun 18, 2026 14:595,21250,939,70742,099,0001,166,0002,113,536
6Jun 18, 2026 14:595,21354,373,73642,256,0001,017,0002,113,536
7Jun 18, 2026 14:595,24151,769,72642,447,0001,057,0002,113,536
8Jun 18, 2026 14:595,41852,630,25743,888,0001,087,0002,113,536
9Jun 18, 2026 14:595,43052,747,36643,935,0001,140,0002,113,536