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 10, 2026 10:21wnwnScore: 3,417Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:213,38340,824,12226,991,0001,091,0002,486,272
2May 10, 2026 10:213,38642,547,92327,042,0001,069,0002,486,272
3May 10, 2026 10:213,39646,452,05727,130,0001,057,0002,482,176
4May 10, 2026 10:213,39942,166,57427,176,0001,039,0002,486,272
5May 10, 2026 10:213,41745,803,72727,257,0001,109,0002,494,464
6May 10, 2026 10:213,42044,406,91327,311,0001,083,0002,490,368
7May 10, 2026 10:213,55046,079,22828,374,0001,094,0002,482,176
8May 10, 2026 10:213,58747,832,20628,660,0001,118,0002,486,272
9May 10, 2026 10:213,61946,199,62928,891,0001,149,0002,482,176