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 19, 2026 16:04Milo PresedoMilo PresedoScore: 8,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:048,15879,109,95066,699,0001,017,0002,113,536
2May 19, 2026 16:048,16178,076,62266,721,0001,018,0002,113,536
3May 19, 2026 16:048,16177,406,95366,727,0001,017,0002,113,536
4May 19, 2026 16:048,16578,919,53466,760,0001,017,0002,113,536
5May 19, 2026 16:048,17680,084,01566,846,0001,019,0002,113,536
6May 19, 2026 16:048,17980,035,74966,869,0001,017,0002,113,536
7May 19, 2026 16:048,18180,099,86666,892,0001,017,0002,113,536
8May 19, 2026 16:048,19478,059,05966,996,0001,018,0002,113,536
9May 19, 2026 16:048,64380,963,11170,720,0001,018,0002,113,536