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 15:48parastromparastromScore: 5,134Success
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 15:495,12552,906,28741,504,0001,038,0002,113,536
2Sep 29, 2026 15:495,12753,015,99041,514,0001,043,0002,113,536
3Sep 29, 2026 15:495,13052,972,97741,485,0001,102,0002,113,536
4Sep 29, 2026 15:495,13153,012,97941,552,0001,043,0002,113,536
5Sep 29, 2026 15:495,13453,032,61141,545,0001,072,0002,113,536
6Sep 29, 2026 15:495,16753,374,57441,837,0001,054,0002,113,536
7Sep 29, 2026 15:495,17353,502,39241,888,0001,055,0002,113,536
8Sep 29, 2026 15:495,18453,394,14741,981,0001,050,0002,113,536
9Sep 29, 2026 15:495,20253,522,37642,055,0001,126,0002,113,536