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 30, 2026 19:08Josu San MartinJosu San MartinScore: 4,349Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:094,32044,259,94934,794,0001,065,0002,113,536
2Aug 30, 2026 19:094,33544,372,61534,871,0001,112,0002,113,536
3Aug 30, 2026 19:094,34644,551,11234,953,0001,126,0002,113,536
4Aug 30, 2026 19:094,34644,493,67134,960,0001,119,0002,113,536
5Aug 30, 2026 19:094,34944,597,65134,972,0001,132,0002,113,536
6Aug 30, 2026 19:094,35244,650,92934,995,0001,132,0002,113,536
7Aug 30, 2026 19:094,35244,521,56235,056,0001,067,0002,113,536
8Aug 30, 2026 19:094,42845,121,37535,540,0001,219,0002,113,536
9Aug 30, 2026 19:095,41753,421,27443,837,0001,129,0002,113,536