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 05:14M-RochatM-RochatScore: 30,693Success
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 05:1430,687263,971,810253,701,0001,007,0002,113,536
2May 20, 2026 05:1430,688266,929,789253,707,0001,006,0002,113,536
3May 20, 2026 05:1430,689264,314,273253,715,0001,008,0002,113,536
4May 20, 2026 05:1430,690265,993,574253,726,0001,008,0002,113,536
5May 20, 2026 05:1430,693265,841,107253,753,0001,006,0002,113,536
6May 20, 2026 05:1430,697265,515,302253,787,0001,006,0002,113,536
7May 20, 2026 05:1430,698264,516,382253,792,0001,006,0002,113,536
8May 20, 2026 05:1430,699264,646,495253,797,0001,008,0002,113,536
9May 20, 2026 05:1430,700267,061,968253,809,0001,008,0002,113,536