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 24, 2026 20:16janwwwjanwwwScore: 6,436Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 20:166,37563,126,57750,733,0002,183,0002,113,536
2Sep 24, 2026 20:166,37863,174,85350,759,0002,184,0002,113,536
3Sep 24, 2026 20:166,39364,711,99850,887,0002,176,0002,113,536
4Sep 24, 2026 20:166,41563,495,83351,041,0002,209,0002,113,536
5Sep 24, 2026 20:166,43663,733,20751,403,0002,017,0002,113,536
6Sep 24, 2026 20:166,43863,649,54651,198,0002,241,0002,113,536
7Sep 24, 2026 20:166,45264,281,61751,349,0002,209,0002,113,536
8Sep 24, 2026 20:166,49264,216,58551,628,0002,261,0002,113,536
9Sep 24, 2026 20:166,58264,963,70252,541,0002,091,0002,113,536