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 20, 2025 18:00Adam FolwarcznyAdam FolwarcznyScore: 31,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2025 18:0031,227289,054,329258,187,0001,000,0002,281,472
2Aug 20, 2025 18:0031,385285,359,165259,494,0001,001,0002,531,328
3Aug 20, 2025 18:0031,385287,466,823259,491,0001,001,0002,269,184
4Aug 20, 2025 18:0031,390285,831,034259,531,0001,002,0002,531,328
5Aug 20, 2025 18:0031,402292,467,384258,636,0001,997,0002,281,472
6Aug 20, 2025 18:0031,771289,483,552261,701,0001,997,0002,281,472
7Aug 20, 2025 18:0031,771288,861,408261,706,0001,997,0002,269,184
8Aug 20, 2025 18:0031,774295,042,663261,726,0001,997,0002,531,328
9Aug 20, 2025 18:0031,780284,925,435261,777,0001,998,0002,531,328