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 13:10scompa18scompa18Score: 32,256Success
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 13:1032,058289,461,794265,083,0001,000,0002,523,136
2Jan 5, 2025 13:1032,227287,467,848267,483,00002,281,472
3Jan 5, 2025 13:1032,251295,078,023265,687,0001,997,0002,273,280
4Jan 5, 2025 13:1032,253297,561,645265,701,0001,997,0002,281,472
5Jan 5, 2025 13:1032,256297,995,312266,726,000998,0002,281,472
6Jan 5, 2025 13:1032,260295,150,717266,763,000999,0002,514,944
7Jan 5, 2025 13:1032,267295,758,274265,816,0001,998,0002,273,280
8Jan 5, 2025 13:1032,267290,434,214265,817,0001,998,0002,281,472
9Jan 5, 2025 13:1032,278291,948,751265,907,0001,999,0002,281,472