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 listJan 12, 2025 12:43AdityaAdityaScore: 78,090Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2025 12:4378,013673,431,485565,572,00081,938,0002,273,280
2Jan 12, 2025 12:4378,020676,971,938590,602,00056,961,0002,273,280
3Jan 12, 2025 12:4378,025672,694,104603,637,00043,973,0002,273,280
4Jan 12, 2025 12:4378,082670,743,934585,075,00063,008,0002,273,280
5Jan 12, 2025 12:4378,090669,526,390576,016,00072,127,0002,273,280
6Jan 12, 2025 12:4378,137672,602,093581,485,00067,055,0002,506,752
7Jan 12, 2025 12:4378,240678,352,404567,344,00082,049,0002,273,280
8Jan 12, 2025 12:4378,455674,537,288585,161,00066,018,0002,383,872
9Jan 12, 2025 12:4378,456674,387,974586,170,00065,018,0002,379,776