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 listApr 27, 2026 00:28olliecrowolliecrowScore: 9,430Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 00:309,27385,215,85773,975,0002,999,0002,486,272
2Apr 27, 2026 00:309,33384,727,25473,442,0004,024,0002,494,464
3Apr 27, 2026 00:309,35585,770,24672,608,0005,042,0002,461,696
4Apr 27, 2026 00:309,41186,344,03374,112,0004,006,0002,441,216
5Apr 27, 2026 00:309,43085,566,06975,266,0003,010,0002,314,240
6Apr 27, 2026 00:309,63588,266,20674,980,0004,998,0002,449,408
7Apr 27, 2026 00:309,66688,408,61677,222,0003,008,0002,519,040
8Apr 27, 2026 00:309,67887,571,15176,317,0004,016,0002,564,096
9Apr 27, 2026 00:309,90389,485,89877,184,0005,011,0002,351,104