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 listApr 21, 2026 01:59cashkarucashkaruScore: 61,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 02:0061,300530,552,977507,795,000999,0002,506,752
2Apr 21, 2026 02:0061,301531,534,861506,804,0001,999,0002,265,088
3Apr 21, 2026 02:0061,304536,151,536506,827,0001,999,0002,494,464
4Apr 21, 2026 02:0061,304534,789,260506,832,0001,999,0002,494,464
5Apr 21, 2026 02:0061,310534,647,141506,879,0001,999,0002,273,280
6Apr 21, 2026 02:0061,313535,335,783504,903,0003,999,0002,494,464
7Apr 21, 2026 02:0061,319531,421,764505,952,0002,999,0002,273,280
8Apr 21, 2026 02:0061,323534,572,024505,983,0002,999,0002,502,656
9Apr 21, 2026 02:0061,342534,096,146506,139,0003,000,0002,256,896