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 1, 2026 23:39TonyTonyScore: 39,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 23:3937,746324,247,429312,239,0001,061,0002,113,536
2Aug 1, 2026 23:3939,020335,337,914322,858,0001,013,0002,113,536
3Aug 1, 2026 23:3939,033334,059,691322,913,0001,061,0002,113,536
4Aug 1, 2026 23:3939,356336,776,400325,632,0001,029,0002,113,536
5Aug 1, 2026 23:3939,360336,813,223325,629,0001,061,0002,113,536
6Aug 1, 2026 23:3939,366336,870,139325,684,0001,059,0002,113,536
7Aug 1, 2026 23:3939,381337,757,941325,863,0001,003,0002,113,536
8Aug 1, 2026 23:3939,436337,357,160326,273,0001,051,0002,113,536
9Aug 1, 2026 23:3939,473339,851,398326,566,0001,065,0002,113,536