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 listSep 29, 2026 16:16parastromparastromScore: 4,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 16:174,30046,127,64434,635,0001,057,0002,113,536
2Sep 29, 2026 16:174,38846,946,94335,312,0001,111,0002,113,536
3Sep 29, 2026 16:174,39947,069,19735,370,0001,149,0002,113,536
4Sep 29, 2026 16:174,39947,017,63635,424,0001,094,0002,113,536
5Sep 29, 2026 16:174,40947,070,68535,393,0001,208,0002,113,536
6Sep 29, 2026 16:174,42947,252,79735,649,0001,118,0002,113,536
7Sep 29, 2026 16:174,43047,327,33335,644,0001,129,0002,113,536
8Sep 29, 2026 16:174,43347,335,74135,533,0001,262,0002,113,536
9Sep 29, 2026 16:174,48847,656,34336,095,0001,159,0002,113,536