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 20:09Josu San MartinJosu San MartinScore: 4,312Success
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 20:104,29144,040,65834,565,0001,052,0002,113,536
2Aug 30, 2026 20:104,29944,144,06034,560,0001,125,0002,113,536
3Aug 30, 2026 20:104,30444,128,65234,620,0001,107,0002,113,536
4Aug 30, 2026 20:104,30644,207,86134,623,0001,124,0002,113,536
5Aug 30, 2026 20:104,31244,264,15434,666,0001,131,0002,113,536
6Aug 30, 2026 20:104,31344,203,59834,687,0001,115,0002,113,536
7Aug 30, 2026 20:104,40445,055,37535,519,0001,035,0002,113,536
8Aug 30, 2026 20:104,43045,282,31135,657,0001,118,0002,113,536
9Aug 30, 2026 20:105,14452,353,46041,589,0001,109,0002,113,536