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 01:55M-RochatM-RochatScore: 12,733Success
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 01:5612,649114,708,189102,733,0002,258,0002,113,536
2May 17, 2026 01:5612,662113,812,123102,890,0002,206,0002,113,536
3May 17, 2026 01:5612,676115,537,520102,984,0002,234,0002,113,536
4May 17, 2026 01:5612,732117,061,044102,495,0003,181,0002,113,536
5May 17, 2026 01:5612,733114,530,412103,516,0002,172,0002,113,536
6May 17, 2026 01:5612,748116,708,238102,591,0003,218,0002,113,536
7May 17, 2026 01:5612,792115,166,046102,862,0003,317,0002,113,536
8May 17, 2026 01:5612,798115,040,681103,022,0003,209,0002,113,536
9May 17, 2026 01:5612,844133,956,889103,342,0003,264,0002,113,536