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 04:10Andrew EpsteinAndrew EpsteinScore: 3,502Success
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 04:113,49038,190,54528,972,000020,480
2Nov 3, 2026 04:113,49238,211,50628,984,000020,480
3Nov 3, 2026 04:113,50138,291,14829,060,000020,480
4Nov 3, 2026 04:113,50238,248,78129,067,000020,480
5Nov 3, 2026 04:113,50238,330,14229,073,000020,480
6Nov 3, 2026 04:113,50338,339,03829,075,000020,480
7Nov 3, 2026 04:113,50438,343,37129,088,000020,480
8Nov 3, 2026 04:113,51438,444,28229,173,000020,480
9Nov 3, 2026 04:113,51538,399,73629,182,000020,480