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 listJun 8, 2025 21:30Hayk KarapetyanHayk KarapetyanScore: 86,611Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2025 21:3086,452736,246,547658,510,00059,045,0002,289,664
2Jun 8, 2025 21:3086,452742,097,640661,586,00055,965,0002,281,472
3Jun 8, 2025 21:3086,467739,897,862652,705,00064,970,0002,453,504
4Jun 8, 2025 21:3086,498741,188,673662,939,00054,995,0002,449,408
5Jun 8, 2025 21:3086,611739,964,097659,879,00058,989,0002,289,664
6Jun 8, 2025 21:3086,637742,305,244666,082,00053,006,0002,445,312
7Jun 8, 2025 21:3086,682751,349,925655,506,00063,951,0002,281,472
8Jun 8, 2025 21:3086,705743,791,280657,681,00061,969,0002,289,664
9Jun 8, 2025 21:3086,714741,534,811655,752,00063,975,0002,289,664