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 5, 2025 14:03scompa18scompa18Score: 31,843Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 5, 2025 14:0331,815286,404,093263,061,0001,000,0002,527,232
2Jan 5, 2025 14:0331,821285,682,092262,117,0002,000,0002,269,184
3Jan 5, 2025 14:0331,835293,081,173262,228,0002,001,0002,269,184
4Jan 5, 2025 14:0331,841291,286,921264,280,00002,293,760
5Jan 5, 2025 14:0331,843291,345,854263,294,0001,001,0002,523,136
6Jan 5, 2025 14:0331,847287,966,636263,332,0001,001,0002,281,472
7Jan 5, 2025 14:0331,848294,676,641264,338,00002,281,472
8Jan 5, 2025 14:0331,851290,904,097262,360,0002,002,0002,281,472
9Jan 5, 2025 14:0331,889292,046,253262,679,0001,997,0002,281,472