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 listFeb 21, 2025 20:30Ian MckibbenIan MckibbenScore: 29,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2025 20:3029,968275,078,498246,737,0001,997,0002,437,120
2Feb 21, 2025 20:3029,971272,300,701247,761,000999,0002,510,848
3Feb 21, 2025 20:3029,972273,924,309247,768,000999,0002,531,328
4Feb 21, 2025 20:3029,972274,856,251247,765,000999,0002,531,328
5Feb 21, 2025 20:3029,973271,802,160247,778,000999,0002,531,328
6Feb 21, 2025 20:3029,987269,276,747247,893,000999,0002,269,184
7Feb 21, 2025 20:3029,991268,360,207247,930,000999,0002,510,848
8Feb 21, 2025 20:3029,998271,009,931247,985,000999,0002,531,328
9Feb 21, 2025 20:3030,003272,351,823249,027,00002,510,848