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 29, 2026 16:25parastromparastromScore: 4,522Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 16:274,41047,088,62735,516,0001,087,0002,113,536
2Sep 29, 2026 16:274,44547,359,16335,853,0001,045,0002,113,536
3Sep 29, 2026 16:274,49947,848,12036,220,0001,128,0002,113,536
4Sep 29, 2026 16:274,51247,913,53736,321,0001,135,0002,113,536
5Sep 29, 2026 16:274,52248,052,29036,404,0001,132,0002,113,536
6Sep 29, 2026 16:274,52548,130,87236,432,0001,132,0002,113,536
7Sep 29, 2026 16:274,53248,115,78636,489,0001,130,0002,113,536
8Sep 29, 2026 16:274,53548,250,35536,487,0001,156,0002,113,536
9Sep 29, 2026 16:274,55148,327,44936,624,0001,150,0002,113,536