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 16, 2026 05:56Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 05:57068,291,85457,799,00002,113,536expected "53678399262435413 ", got "53678376222435413 "
2May 16, 2026 05:576,95167,269,70356,690,0001,008,0002,113,536
3May 16, 2026 05:576,95165,921,76156,686,0001,009,0002,113,536
4May 16, 2026 05:576,95367,082,66757,717,00002,113,536
5May 16, 2026 05:576,95765,549,40856,706,0001,041,0002,113,536
6May 16, 2026 05:576,95967,102,14456,743,0001,024,0002,113,536
7May 16, 2026 05:576,96065,089,59456,748,0001,021,0002,113,536
8May 16, 2026 05:576,96266,910,85656,767,0001,018,0002,113,536
9May 16, 2026 05:577,01367,406,84657,163,0001,048,0002,113,536