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 5, 2026 12:39Kevin HeaveyKevin HeaveyScore: 20,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 12:3920,595180,528,029169,875,0001,064,0002,117,632
2Jul 5, 2026 12:3920,599180,583,947169,911,0001,065,0002,117,632
3Jul 5, 2026 12:3920,604180,537,298169,958,0001,060,0002,117,632
4Jul 5, 2026 12:3920,605180,618,491169,943,0001,085,0002,117,632
5Jul 5, 2026 12:3920,606180,588,621169,910,0001,127,0002,117,632
6Jul 5, 2026 12:3920,606180,566,952169,982,0001,053,0002,117,632
7Jul 5, 2026 12:3920,616180,733,234169,960,0001,157,0002,117,632
8Jul 5, 2026 12:3920,621180,675,604170,012,0001,147,0002,117,632
9Jul 5, 2026 12:3920,624181,966,033170,028,0001,157,0002,117,632