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:40parastromparastromScore: 4,166Success
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:424,09144,445,90432,872,0001,090,0002,113,536
2Sep 29, 2026 16:424,10144,548,45532,985,0001,058,0002,113,536
3Sep 29, 2026 16:424,12544,610,44133,050,0001,193,0002,113,536
4Sep 29, 2026 16:424,14444,880,86033,274,0001,126,0002,113,536
5Sep 29, 2026 16:424,16645,045,78633,457,0001,121,0002,113,536
6Sep 29, 2026 16:424,17545,154,62333,490,0001,166,0002,113,536
7Sep 29, 2026 16:424,18245,215,59433,512,0001,204,0002,113,536
8Sep 29, 2026 16:424,18845,218,47533,641,0001,126,0002,113,536
9Sep 29, 2026 16:424,23045,587,82734,018,0001,093,0002,113,536