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 11, 2026 11:27RabenknechtRabenknechtScore: 66,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:2865,659555,798,009543,911,0001,060,0002,113,536
2Aug 11, 2026 11:2865,673556,213,602544,046,0001,047,0002,113,536
3Aug 11, 2026 11:2866,066559,164,170547,226,0001,122,0002,113,536
4Aug 11, 2026 11:2866,308561,276,075549,243,0001,117,0002,113,536
5Aug 11, 2026 11:2866,533563,002,429551,181,0001,049,0002,113,536
6Aug 11, 2026 11:2866,681563,577,159552,350,0001,105,0002,113,536
7Aug 11, 2026 11:2866,687563,554,595552,410,0001,096,0002,113,536
8Aug 11, 2026 11:2866,723564,005,647552,687,0001,120,0002,113,536
9Aug 11, 2026 11:2866,728564,640,856552,791,0001,056,0002,113,536