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 listAug 1, 2026 18:41TonyTonyScore: 212,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 18:41212,2341,771,880,5721,702,385,00059,159,0002,113,536
2Aug 1, 2026 18:41212,3041,772,336,2781,702,844,00059,285,0002,113,536
3Aug 1, 2026 18:41212,3321,773,265,9881,703,066,00059,296,0002,113,536
4Aug 1, 2026 18:41212,3401,772,635,6261,703,101,00059,321,0002,113,536
5Aug 1, 2026 18:41212,3881,773,792,2131,703,111,00059,714,0002,113,536
6Aug 1, 2026 18:41212,4031,773,077,7091,703,085,00059,867,0002,113,536
7Aug 1, 2026 18:41212,4071,773,882,5361,703,417,00059,568,0002,113,536
8Aug 1, 2026 18:41212,4401,774,232,6641,703,988,00059,271,0002,113,536
9Aug 1, 2026 18:41212,4851,774,120,5581,704,004,00059,629,0002,113,536