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 listAug 2, 2026 15:44CodeReclaimersCodeReclaimersScore: 5,415Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:455,21253,372,68142,247,0001,016,0002,113,536
2Aug 2, 2026 15:455,37055,239,64943,564,0001,014,0002,113,536
3Aug 2, 2026 15:455,39454,739,11043,765,0001,013,0002,113,536
4Aug 2, 2026 15:455,40555,607,31543,849,0001,014,0002,113,536
5Aug 2, 2026 15:455,41555,702,06643,932,0001,013,0002,113,536
6Aug 2, 2026 15:455,43055,119,98644,055,0001,014,0002,113,536
7Aug 2, 2026 15:455,43155,916,11544,068,0001,014,0002,113,536
8Aug 2, 2026 15:455,43355,928,77344,087,0001,013,0002,113,536
9Aug 2, 2026 15:455,50156,048,53844,647,0001,015,0002,113,536