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 14, 2026 07:26Victor MerckléVictor MerckléScore: 6,991Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 07:266,98865,646,62056,963,0001,042,0002,113,536
2May 14, 2026 07:266,98967,986,15156,966,0001,044,0002,113,536
3May 14, 2026 07:266,98965,961,59457,004,0001,005,0002,113,536
4May 14, 2026 07:266,98967,398,78057,008,0001,001,0002,113,536
5May 14, 2026 07:266,99167,116,64158,033,00002,113,536
6May 14, 2026 07:266,99267,199,38557,038,0001,002,0002,113,536
7May 14, 2026 07:266,99566,318,03057,031,0001,035,0002,113,536
8May 14, 2026 07:267,02766,725,44258,330,00002,113,536
9May 14, 2026 07:267,05668,943,02857,462,0001,103,0002,113,536