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 12:59George SeabridgeGeorge SeabridgeScore: 8,144Success
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:006,87167,064,93455,955,0001,081,0002,113,536
2Aug 1, 2026 13:006,92267,458,15056,363,0001,097,0002,113,536
3Aug 1, 2026 13:006,92267,459,86556,377,0001,081,0002,113,536
4Aug 1, 2026 13:008,13077,534,07266,383,0001,104,0002,113,536
5Aug 1, 2026 13:008,14477,571,36566,501,0001,096,0002,113,536
6Aug 1, 2026 13:008,14577,657,31866,510,0001,100,0002,113,536
7Aug 1, 2026 13:008,15777,645,67366,630,0001,077,0002,113,536
8Aug 1, 2026 13:008,17077,883,15766,715,0001,098,0002,113,536
9Aug 1, 2026 13:008,20678,160,05367,018,0001,099,0002,113,536