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 5, 2026 07:37M-RochatM-RochatScore: 78,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 07:3878,238666,356,134591,254,00058,129,0002,351,104
2May 5, 2026 07:3878,255667,930,649591,249,00058,275,0002,359,296
3May 5, 2026 07:3878,279668,281,481591,226,00058,493,0002,359,296
4May 5, 2026 07:3878,280664,661,828591,268,00058,461,0002,363,392
5May 5, 2026 07:3878,293663,985,406591,061,00058,772,0002,351,104
6May 5, 2026 07:3878,380669,325,648591,202,00059,357,0002,367,488
7May 5, 2026 07:3878,421669,564,743591,051,00059,849,0002,367,488
8May 5, 2026 07:3878,429669,454,228591,362,00059,605,0002,367,488
9May 5, 2026 07:3878,493668,069,094591,179,00060,320,0002,355,200