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 21, 2025 23:42Gerard SmitGerard SmitScore: 57,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 23:4257,539506,390,973475,574,0001,998,0002,293,760
2Jan 21, 2025 23:4257,632504,240,148476,344,0002,001,0002,387,968
3Jan 21, 2025 23:4257,638510,827,153477,394,0001,000,0002,387,968
4Jan 21, 2025 23:4257,639507,649,201477,407,0001,000,0002,293,760
5Jan 21, 2025 23:4257,640504,678,675477,408,0001,000,0002,310,144
6Jan 21, 2025 23:4257,641503,647,767477,422,0001,000,0002,379,776
7Jan 21, 2025 23:4257,665506,014,748475,625,0002,997,0002,314,240
8Jan 21, 2025 23:4257,678507,030,267476,732,0001,998,0002,293,760
9Jan 21, 2025 23:4257,679510,176,068475,739,0002,998,0002,314,240