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 listJul 16, 2026 08:07wnwnScore: 3,711Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2026 08:073,69738,804,91129,654,0001,039,0002,113,536
2Jul 16, 2026 08:073,69738,846,70129,657,0001,032,0002,113,536
3Jul 16, 2026 08:073,70038,634,82829,670,0001,045,0002,113,536
4Jul 16, 2026 08:073,70538,683,96929,739,0001,016,0002,113,536
5Jul 16, 2026 08:073,71139,389,03829,758,0001,047,0002,113,536
6Jul 16, 2026 08:073,71638,879,19329,808,0001,038,0002,113,536
7Jul 16, 2026 08:073,81641,965,76330,671,0001,003,0002,113,536
8Jul 16, 2026 08:073,87040,267,95231,123,0001,004,0002,113,536
9Jul 16, 2026 08:073,87940,638,15131,185,0001,018,0002,113,536