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 listMay 10, 2026 04:04Josu San MartinJosu San MartinScore: 4,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 04:044,33651,821,50634,886,0001,105,0002,551,808
2May 10, 2026 04:044,36653,871,47735,166,0001,078,0002,543,616
3May 10, 2026 04:044,36754,734,31335,181,0001,072,0002,551,808
4May 10, 2026 04:044,36952,935,66135,236,0001,029,0002,543,616
5May 10, 2026 04:044,37454,434,80235,272,0001,033,0002,547,712
6May 10, 2026 04:044,37753,142,44535,303,0001,034,0002,551,808
7May 10, 2026 04:044,38451,659,27135,322,0001,073,0002,551,808
8May 10, 2026 04:044,39253,207,19735,232,0001,225,0002,560,000
9May 10, 2026 04:044,46850,839,12435,903,0001,183,0002,547,712