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 11:38Victor MerckléVictor MerckléScore: 5,617Success
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 11:395,57654,111,74845,213,0001,074,0002,113,536
2May 20, 2026 11:395,59756,749,69445,453,0001,008,0002,113,536
3May 20, 2026 11:395,60755,520,85245,499,0001,042,0002,113,536
4May 20, 2026 11:395,61054,663,67345,502,0001,062,0002,113,536
5May 20, 2026 11:395,61755,737,53045,573,0001,054,0002,113,536
6May 20, 2026 11:395,62155,863,86545,600,0001,058,0002,113,536
7May 20, 2026 11:395,62654,503,11945,636,0001,060,0002,113,536
8May 20, 2026 11:395,62855,508,56745,683,0001,032,0002,113,536
9May 20, 2026 11:395,71157,062,79446,369,0001,040,0002,113,536