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 listFeb 1, 2026 13:51kkxkkxScore: 73,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2026 13:5172,879632,082,497549,903,00054,990,0002,523,136
2Feb 1, 2026 13:5173,012630,533,669542,997,00062,999,0002,523,136
3Feb 1, 2026 13:5173,013631,934,020556,010,00050,000,0002,519,040
4Feb 1, 2026 13:5173,043628,509,138555,235,00051,021,0002,265,088
5Feb 1, 2026 13:5173,080638,415,368559,599,00046,966,0002,510,848
6Feb 1, 2026 13:5173,104636,405,789550,783,00055,977,0002,523,136
7Feb 1, 2026 13:5173,125633,107,658547,946,00058,994,0002,260,992
8Feb 1, 2026 13:5173,177638,882,185560,342,00047,028,0002,510,848
9Feb 1, 2026 13:5173,286632,227,275551,245,00057,025,0002,519,040