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 4, 2026 10:01Teow Hua JunTeow Hua JunScore: 5,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 10:015,93259,256,23748,154,0001,089,0002,113,536
2Aug 4, 2026 10:015,93360,027,15448,146,0001,101,0002,113,536
3Aug 4, 2026 10:015,93659,270,02448,153,0001,119,0002,113,536
4Aug 4, 2026 10:015,93659,302,25048,158,0001,115,0002,113,536
5Aug 4, 2026 10:015,95059,408,96648,259,0001,133,0002,113,536
6Aug 4, 2026 10:015,95659,388,46548,325,0001,116,0002,113,536
7Aug 4, 2026 10:015,95659,551,36148,281,0001,155,0002,113,536
8Aug 4, 2026 10:015,96060,263,09548,309,0001,162,0002,113,536
9Aug 4, 2026 10:015,96459,567,58148,380,0001,128,0002,113,536