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 listNov 3, 2026 07:21Andrew EpsteinAndrew EpsteinScore: 3,476Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 07:263,43137,689,41328,482,000020,480
2Nov 3, 2026 07:263,45737,921,28828,699,000020,480
3Nov 3, 2026 07:263,45837,854,89128,703,000020,480
4Nov 3, 2026 07:263,46738,003,01428,778,000020,480
5Nov 3, 2026 07:263,47638,034,81628,857,000020,480
6Nov 3, 2026 07:263,48738,160,43927,905,0001,045,00020,480
7Nov 3, 2026 07:263,49538,302,25729,009,000020,480
8Nov 3, 2026 07:263,49940,260,07329,042,000020,480
9Nov 3, 2026 07:263,51038,288,17529,134,000020,480