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 22, 2026 23:51M-RochatM-RochatScore: 6,597Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 23:516,51463,378,37353,057,0001,016,0002,113,536
2May 22, 2026 23:516,52465,386,53753,139,0001,016,0002,113,536
3May 22, 2026 23:516,53063,412,53053,189,0001,016,0002,113,536
4May 22, 2026 23:516,58865,622,53553,660,0001,021,0002,113,536
5May 22, 2026 23:516,59763,979,46153,744,0001,016,0002,113,536
6May 22, 2026 23:516,61164,263,35353,862,0001,017,0002,113,536
7May 22, 2026 23:516,62466,138,23353,970,0001,016,0002,113,536
8May 22, 2026 23:516,63764,455,48954,076,0001,018,0002,113,536
9May 22, 2026 23:516,64366,198,79354,127,0001,018,0002,113,536