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 listAug 30, 2026 19:13Josu San MartinJosu San MartinScore: 4,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 19:154,31244,183,08334,759,0001,037,0002,113,536
2Aug 30, 2026 19:154,32444,321,21334,843,0001,054,0002,113,536
3Aug 30, 2026 19:154,33744,434,21434,952,0001,051,0002,113,536
4Aug 30, 2026 19:154,33745,635,76834,950,0001,052,0002,113,536
5Aug 30, 2026 19:154,34044,509,62834,993,0001,032,0002,113,536
6Aug 30, 2026 19:154,34644,479,95535,053,0001,024,0002,113,536
7Aug 30, 2026 19:154,35144,591,32734,993,0001,126,0002,113,536
8Aug 30, 2026 19:154,35344,539,06934,997,0001,134,0002,113,536
9Aug 30, 2026 19:154,42945,182,21635,707,0001,054,0002,113,536