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 15, 2026 23:45marko1597marko1597Score: 6,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 00:076,28462,123,29351,025,0001,136,0002,113,536
2Aug 16, 2026 00:076,30962,353,43451,244,0001,122,0002,113,536
3Aug 16, 2026 00:076,38963,082,42451,879,0001,154,0002,113,536
4Aug 16, 2026 00:076,42268,121,56552,137,0001,169,0002,113,536
5Aug 16, 2026 00:076,43764,198,89252,238,0001,196,0002,113,536
6Aug 16, 2026 00:076,64765,889,42954,053,0001,125,0002,113,536
7Aug 16, 2026 00:076,65566,068,08054,091,0001,150,0002,113,536
8Aug 16, 2026 00:076,66666,073,84654,187,0001,143,0002,113,536
9Aug 16, 2026 00:076,67866,223,76154,245,0001,183,0002,113,536