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 1, 2026 23:32TonyTonyScore: 28,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 23:3228,263244,579,513233,583,0001,008,0002,113,536
2Aug 1, 2026 23:3228,504246,540,160235,578,0001,008,0002,113,536
3Aug 1, 2026 23:3228,530246,694,984235,796,0001,007,0002,113,536
4Aug 1, 2026 23:3228,571247,146,783236,138,0001,007,0002,113,536
5Aug 1, 2026 23:3228,609247,416,761236,452,0001,008,0002,113,536
6Aug 1, 2026 23:3228,666247,938,381236,921,0001,008,0002,113,536
7Aug 1, 2026 23:3228,754248,579,878237,654,0001,008,0002,113,536
8Aug 1, 2026 23:3228,773250,039,371237,809,0001,008,0002,113,536
9Aug 1, 2026 23:3228,966250,256,002239,417,0001,009,0002,113,536