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 listOct 27, 2025 05:41Weitao WanWeitao WanScore: 65,702Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 05:4165,681572,865,044544,154,0001,000,0002,256,896
2Oct 27, 2025 05:4165,698574,466,986544,297,0001,000,0002,379,776
3Oct 27, 2025 05:4165,699572,398,666544,298,0001,000,0002,379,776
4Oct 27, 2025 05:4165,701574,729,400545,315,00002,502,656
5Oct 27, 2025 05:4165,702569,612,065545,324,00002,260,992
6Oct 27, 2025 05:4165,706575,859,189545,361,00002,379,776
7Oct 27, 2025 05:4165,708575,703,273545,373,00002,519,040
8Oct 27, 2025 05:4165,717575,397,594545,454,00002,260,992
9Oct 27, 2025 05:4165,733577,056,136543,585,0001,998,0002,469,888