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 28, 2026 09:13TudyMTudyMScore: 34,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2026 09:1434,510305,234,544285,432,0001,001,0002,387,968
2Apr 28, 2026 09:1434,603303,039,630286,213,0001,000,0002,375,680
3Apr 28, 2026 09:1434,606304,617,478286,235,0001,000,0002,383,872
4Apr 28, 2026 09:1434,613301,139,354283,287,0004,004,0002,306,048
5Apr 28, 2026 09:1434,615304,901,425285,306,0002,002,0002,383,872
6Apr 28, 2026 09:1434,615308,676,202283,301,0004,004,0002,387,968
7Apr 28, 2026 09:1434,631309,166,538286,440,0001,001,0002,379,776
8Apr 28, 2026 09:1434,633304,073,703286,454,0001,001,0002,383,872
9Apr 28, 2026 09:1434,648304,746,496285,587,0001,997,0002,387,968