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 listOct 16, 2026 19:03KacpxerKacpxerScore: 5,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 19:035,71056,479,19646,386,0001,013,0002,117,632
2Oct 16, 2026 19:035,72256,555,44346,488,0001,012,0002,117,632
3Oct 16, 2026 19:035,74056,859,84846,636,0001,013,0002,117,632
4Oct 16, 2026 19:035,81457,395,43947,249,0001,013,0002,117,632
5Oct 16, 2026 19:035,98060,161,37448,626,0001,012,0002,117,632
6Oct 16, 2026 19:036,27561,204,19151,075,0001,010,0002,117,632
7Oct 16, 2026 19:036,54863,514,86953,340,0001,010,0002,117,632
8Oct 16, 2026 19:036,57163,631,49753,535,0001,012,0002,117,632
9Oct 16, 2026 19:036,64364,268,20954,125,0001,014,0002,117,632