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 16, 2026 20:29Yuriy LyfenkoYuriy LyfenkoScore: 9,984Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 20:299,979110,308,07280,828,0001,995,0002,273,280
2Mar 16, 2026 20:299,984106,793,43880,870,0001,996,0002,273,280
3Mar 16, 2026 20:299,989108,259,39980,911,0001,997,0002,277,376