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 17, 2026 19:55Navneet RajNavneet RajScore: 55,577Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 19:5654,663466,420,252452,600,0001,107,0002,113,536
2Aug 17, 2026 19:5654,894465,448,544454,478,0001,146,0002,113,536
3Aug 17, 2026 19:5655,146467,543,427456,529,0001,188,0002,113,536
4Aug 17, 2026 19:5655,150468,290,274456,588,0001,163,0002,113,536
5Aug 17, 2026 19:5655,577471,851,720460,285,0001,010,0002,113,536
6Aug 17, 2026 19:5655,639471,673,649460,553,0001,255,0002,113,536
7Aug 17, 2026 19:5655,744472,547,388461,593,0001,085,0002,113,536
8Aug 17, 2026 19:5655,752472,608,586461,635,0001,113,0002,113,536
9Aug 17, 2026 19:5655,764474,917,870461,695,0001,150,0002,113,536