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 listAug 11, 2026 11:25RabenknechtRabenknechtScore: 52,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:2551,560438,837,228426,909,0001,044,0002,113,536
2Aug 11, 2026 11:2551,577438,910,228427,043,0001,050,0002,113,536
3Aug 11, 2026 11:2552,028441,878,197430,731,0001,103,0002,113,536
4Aug 11, 2026 11:2552,136442,750,175431,619,0001,118,0002,113,536
5Aug 11, 2026 11:2552,350445,291,618433,443,0001,065,0002,113,536
6Aug 11, 2026 11:2552,594446,666,974435,493,0001,045,0002,113,536
7Aug 11, 2026 11:2552,598446,594,993435,512,0001,055,0002,113,536
8Aug 11, 2026 11:2552,614447,536,369435,697,0001,005,0002,113,536
9Aug 11, 2026 11:2552,625447,924,043435,709,0001,084,0002,113,536