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 listMar 21, 2026 17:33olliecrowolliecrowScore: 5,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 21, 2026 17:215,73471,702,12042,533,0005,063,0002,334,720
2Mar 21, 2026 17:335,80472,327,58545,164,0003,010,0002,330,624
3Mar 21, 2026 17:215,84977,182,59547,532,0001,011,0002,387,968
4Mar 21, 2026 17:335,88077,992,19045,815,0002,987,0002,424,832
5Mar 21, 2026 17:335,88673,374,96245,863,0002,991,0002,387,968
6Mar 21, 2026 17:216,09078,882,83646,503,0004,043,0002,355,200