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 04:11Josu San MartinJosu San MartinScore: 7,590Success
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 04:117,44170,333,24059,698,0002,065,0002,113,536
2Aug 31, 2026 04:117,51170,873,69160,293,0002,052,0002,113,536
3Aug 31, 2026 04:117,54471,150,88660,065,0002,552,0002,113,536
4Aug 31, 2026 04:117,56171,210,18660,720,0002,040,0002,113,536
5Aug 31, 2026 04:117,59072,095,38760,500,0002,503,0002,113,536
6Aug 31, 2026 04:117,59571,551,54560,476,0002,570,0002,113,536
7Aug 31, 2026 04:117,69972,357,89061,393,0002,516,0002,113,536
8Aug 31, 2026 04:117,74372,764,09862,198,0002,069,0002,113,536
9Aug 31, 2026 04:118,00274,918,32163,848,0002,570,0002,113,536