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:21parastromparastromScore: 4,425Success
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:234,40247,021,74335,528,0001,016,0002,113,536
2Sep 29, 2026 16:234,40347,029,60235,502,0001,051,0002,113,536
3Sep 29, 2026 16:234,40647,079,73135,525,0001,047,0002,113,536
4Sep 29, 2026 16:234,41048,666,00735,485,0001,119,0002,113,536
5Sep 29, 2026 16:234,42547,194,03735,631,0001,101,0002,117,632
6Sep 29, 2026 16:234,44649,228,09235,741,0001,161,0002,113,536
7Sep 29, 2026 16:234,44747,430,36935,773,0001,139,0002,113,536
8Sep 29, 2026 16:234,46347,489,48735,926,0001,124,0002,113,536
9Sep 29, 2026 16:234,50947,997,33036,263,0001,163,0002,113,536