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 listDec 9, 2025 22:05pseppsepScore: 45,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 22:0545,615404,634,916376,611,0001,997,0002,273,280
2Dec 9, 2025 22:1445,752408,712,236379,743,00002,523,136
3Dec 9, 2025 22:0545,757410,652,376376,783,0002,998,0002,273,280
4Dec 9, 2025 22:0545,767404,531,954377,864,0001,999,0002,519,040
5Dec 9, 2025 22:0545,767410,564,057377,870,0001,999,0002,273,280
6Dec 9, 2025 22:1445,771409,818,199377,903,0001,999,0002,273,280
7Dec 9, 2025 22:0545,773405,767,517377,918,0001,999,0002,519,040
8Dec 9, 2025 22:0545,778408,490,183377,958,0001,999,0002,363,392
9Dec 9, 2025 22:0545,784406,867,941379,004,0001,000,0002,273,280
10Dec 9, 2025 22:1445,785407,653,065378,013,0002,000,0002,273,280
11Dec 9, 2025 22:0545,787408,712,912377,036,0003,000,0002,273,280
12Dec 9, 2025 22:0545,793404,865,078378,085,0002,000,0002,273,280