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 17, 2026 19:18user76135user76135Score: 111,414Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 19:19111,248932,809,762691,053,000232,309,0002,113,536
2May 17, 2026 19:19111,262935,627,991689,914,000233,567,0002,113,536
3May 17, 2026 19:19111,340935,118,198687,769,000236,361,0002,113,536
4May 17, 2026 19:19111,410933,950,327689,279,000235,427,0002,113,536
5May 17, 2026 19:19111,414935,685,683690,449,000234,291,0002,113,536
6May 17, 2026 19:19111,574937,788,777689,853,000236,217,0002,113,536
7May 17, 2026 19:19111,656937,609,595690,563,000236,184,0002,113,536
8May 17, 2026 19:19112,404945,170,767690,617,000242,340,0002,113,536
9May 17, 2026 19:19112,889946,450,553690,217,000246,765,0002,113,536