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 listSep 24, 2026 04:57wnwnScore: 3,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 04:573,31536,266,83926,516,0001,006,0002,113,536
2Sep 24, 2026 04:573,31636,264,24526,524,0001,007,0002,113,536
3Sep 24, 2026 04:573,31936,288,96226,516,0001,034,0002,113,536
4Sep 24, 2026 04:573,35636,641,95026,822,0001,035,0002,113,536
5Sep 24, 2026 04:573,43037,242,81227,443,0001,027,0002,113,536
6Sep 24, 2026 04:573,43137,223,72527,475,0001,004,0002,113,536
7Sep 24, 2026 04:573,45737,441,28827,673,0001,028,0002,113,536
8Sep 24, 2026 04:573,46738,172,44327,741,0001,039,0002,113,536
9Sep 24, 2026 04:573,52138,659,87528,220,0001,007,0002,113,536