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 listApr 30, 2025 10:40vahookvahookScore: 53,632Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2025 10:4053,568472,076,696442,619,0001,998,0002,273,280
2Apr 30, 2025 10:4053,574468,586,627442,664,0002,003,0002,273,280
3Apr 30, 2025 10:4053,575465,305,483442,672,0001,998,0002,494,464
4Apr 30, 2025 10:4053,616469,222,820443,013,0002,000,0002,498,560
5Apr 30, 2025 10:4053,632466,608,109444,148,0001,000,0002,273,280
6Apr 30, 2025 10:4053,636467,818,077444,176,0001,000,0002,273,280
7Apr 30, 2025 10:4053,649471,747,896444,284,0001,000,0002,490,368
8Apr 30, 2025 10:4053,657471,547,764444,356,0001,000,0002,273,280
9Apr 30, 2025 10:4053,737467,380,166445,021,0001,000,0002,273,280