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 17, 2026 21:20zielajzielajScore: 3,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2026 21:213,31835,292,61126,517,0001,025,0002,113,536
2May 17, 2026 21:213,35438,130,79526,811,0001,033,0002,113,536
3May 17, 2026 21:213,37336,451,76026,966,0001,036,0002,113,536
4May 17, 2026 21:213,46437,311,81427,717,0001,037,0002,113,536
5May 17, 2026 21:213,47538,227,48627,828,0001,019,0002,113,536
6May 17, 2026 21:213,47839,391,41627,819,0001,049,0002,113,536
7May 17, 2026 21:213,51436,918,41228,151,0001,021,0002,113,536
8May 17, 2026 21:213,53537,722,73728,316,0001,032,0002,113,536
9May 17, 2026 21:2160,073508,311,476497,538,0001,076,0002,113,536