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 15, 2025 14:15Serhat ErenSerhat ErenScore: 395,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2025 14:15394,5693,301,934,8583,200,968,00073,953,0002,281,472
2Aug 15, 2025 14:15394,5803,303,682,6933,211,049,00063,961,0002,289,664
3Aug 15, 2025 14:15394,6903,307,402,2623,197,977,00077,950,0002,510,848
4Aug 15, 2025 14:15394,8543,301,333,1593,219,317,00057,969,0002,285,568
5Aug 15, 2025 14:15395,0153,302,204,9533,209,650,00068,971,0002,281,472
6Aug 15, 2025 14:15395,0593,307,813,5373,233,019,00045,971,0002,285,568
7Aug 15, 2025 14:15395,1083,303,333,6443,210,433,00068,966,0002,285,568
8Aug 15, 2025 14:15396,1683,321,625,5863,212,234,00075,958,0002,289,664
9Aug 15, 2025 14:15396,4113,321,295,3073,216,250,00073,959,0002,281,472