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 listJul 12, 2026 15:02Kevin HeaveyKevin HeaveyScore: 5,765Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 12, 2026 15:044,08243,582,24432,863,0001,020,0002,117,632
2Jul 12, 2026 15:044,09843,662,71032,995,0001,019,0002,117,632
3Jul 12, 2026 15:044,10043,652,94633,015,0001,020,0002,117,632
4Jul 12, 2026 15:044,10343,795,05233,033,0001,023,0002,117,632
5Jul 12, 2026 15:045,76557,897,24746,839,0001,017,0002,117,632
6Jul 12, 2026 15:045,80958,042,47447,202,0001,016,0002,117,632
7Jul 12, 2026 15:045,83658,148,31347,427,0001,018,0002,117,632
8Jul 12, 2026 15:045,85158,291,17847,546,0001,024,0002,117,632
9Jul 12, 2026 15:045,95659,106,28948,423,0001,018,0002,117,632