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 1, 2026 13:07George SeabridgeGeorge SeabridgeScore: 8,125Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:076,81366,566,58555,470,0001,082,0002,113,536
2Aug 1, 2026 13:076,81366,602,50955,468,0001,085,0002,113,536
3Aug 1, 2026 13:076,82967,915,19155,586,0001,095,0002,113,536
4Aug 1, 2026 13:078,10677,355,38066,189,0001,095,0002,113,536
5Aug 1, 2026 13:078,12577,466,20966,355,0001,085,0002,113,536
6Aug 1, 2026 13:078,13177,482,17666,394,0001,095,0002,113,536
7Aug 1, 2026 13:078,14477,621,67866,508,0001,092,0002,113,536
8Aug 1, 2026 13:078,14577,617,54766,587,0001,017,0002,113,536
9Aug 1, 2026 13:078,34379,398,93168,219,0001,030,0002,113,536