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 31, 2026 03:29Josu San MartinJosu San MartinScore: 4,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 31, 2026 03:384,59946,657,56837,153,0001,021,0002,113,536
2Aug 31, 2026 03:384,60146,761,84637,140,0001,050,0002,113,536
3Aug 31, 2026 03:384,60546,839,73237,188,0001,040,0002,113,536
4Aug 31, 2026 03:384,60846,731,61237,212,0001,039,0002,113,536
5Aug 31, 2026 03:384,60846,708,39937,207,0001,046,0002,113,536
6Aug 31, 2026 03:384,60846,751,64237,219,0001,032,0002,113,536
7Aug 31, 2026 03:384,62446,827,64537,335,0001,048,0002,113,536
8Aug 31, 2026 03:384,64046,976,90637,401,0001,113,0002,113,536
9Aug 31, 2026 03:384,66847,219,63837,717,0001,032,0002,113,536